404 research outputs found

    Using Choice Experiments for Non-Market Valuation

    Get PDF
    This paper provides the latest research developments in the method of choice experiments applied to valuation of non-market goods. Choice experiments, along with the, by now, well-known contingent valuation method, are very important tools for valuing non-market goods and the results are used in both cost-benefit analyses and litigations related to damage assessments. The paper should provide the reader with both the means to carry out a choice experiment and to conduct a detailed critical analysis of its performance in order to give informed advice about the results. A discussion of the underlying economic model of choice experiments is incorporated, as well as a presentation of econometric models consistent with economic theory. Furthermore, a detailed discussion on the development of a choice experiment is provided, which in particular focuses on the design of the experiment and tests of validity. Finally, a discussion on different ways to calculate welfare effects is presented.Choice experiments; non-market goods; stated preference methods; valuation

    Permutations destroying arithmetic progressions in finite cyclic groups

    Full text link
    A permutation \pi of an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a,b,c) is a non-trivial 3-term AP in G, that is c-b=b-a and a,b,c are not all equal, then (\pi(a),\pi(b),\pi(c)) is not an AP. In a paper from 2004, the first author conjectured that such a permutation exists of Z/nZ, for all n except 2,3,5 and 7. Here we prove, as a special case of a more general result, that such a permutation exists for all n >= n_0, for some explcitly constructed number n_0 \approx 1.4 x 10^{14}. We also construct such a permutation of Z/pZ for all primes p > 3 such that p = 3 (mod 8).Comment: 11 pages, no figure

    On the existence of accessible paths in various models of fitness landscapes

    Get PDF
    We present rigorous mathematical analyses of a number of well-known mathematical models for genetic mutations. In these models, the genome is represented by a vertex of the nn-dimensional binary hypercube, for some nn, a mutation involves the flipping of a single bit, and each vertex is assigned a real number, called its fitness, according to some rules. Our main concern is with the issue of existence of (selectively) accessible paths; that is, monotonic paths in the hypercube along which fitness is always increasing. Our main results resolve open questions about three such models, which in the biophysics literature are known as house of cards (HoC), constrained house of cards (CHoC) and rough Mount Fuji (RMF). We prove that the probability of there being at least one accessible path from the all-zeroes node v0\mathbf {v}^0 to the all-ones node v1\mathbf {v}^1 tends respectively to 0, 1 and 1, as nn tends to infinity. A crucial idea is the introduction of a generalization of the CHoC model, in which the fitness of v0\mathbf {v}^0 is set to some α=αn[0,1]\alpha=\alpha_n\in[0,1]. We prove that there is a very sharp threshold at αn=lnnn\alpha_n=\frac{\ln n}{n} for the existence of accessible paths from v0\mathbf {v}^0 to v1\mathbf {v}^1. As a corollary we prove significant concentration, for α\alpha below the threshold, of the number of accessible paths about the expected value (the precise statement is technical; see Corollary 1.4). In the case of RMF, we prove that the probability of accessible paths from v0\mathbf {v}^0 to v1\mathbf {v}^1 existing tends to 11 provided the drift parameter θ=θn\theta=\theta_n satisfies nθnn\theta_n\rightarrow\infty, and for any fitness distribution which is continuous on its support and whose support is connected.Comment: Published in at http://dx.doi.org/10.1214/13-AAP949 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

    Does Relative Income Matter for the Very Poor? Evidence from Rural Ethiopia

    Get PDF
    We studied whether relative income has an impact on subjective well-being among extremely poor people. Contrary to the findings in developed countries, where relative income has shown a significant and negative impact on subjective well-being, we cannot reject the hypothesis that relative income has no impact on subjective well-being in rural areas of northern Ethiopia.absolute income, relative income, subjective well-being

    Paying the Price of Sweetening Your Donation: Evidence from a Natural Field Experiment

    Get PDF
    Using a natural field experiment in a recreational site, a public good almost fully dependent on voluntary donations, we explored the crowding-out effect of gift rewards. First, we investigated whether receiving a map in appreciation of a donation crowded out prosocial behavior and found no significant effect of giving the map. Second, we explored the effect of adding the map to a treatment designed to increase donations. Interestingly, when the gift was combined with our attempt to trigger reputational and self image motives, the probability of donating decreased significantly, compared to the social reference treatment alone.crowding-out, donation, natural field experiment, reciprocity

    Sundays Are Blue: Aren’t They? The Day-of-the-Week Effect on Subjective Well-Being and Socio-Economic Status

    Get PDF
    This paper analyses whether individuals are influenced by the day of the week when reporting subjective well-being. By using a large panel data set and controlling for observed and unobserved individual characteristics, we find a large day-of the-week effect. Overall, we find a 'blue' Sunday effect with the lowest level of subjective well-being. The day-of-the-week effect differs with certain socio-economic and demographic factors such as employment, marital status and age. The paper concludes with recommendations for future analyses of subjective well-being data and design of data collections.subjective well-being, day-of-the-week effect

    Don't Tell Me What to Do, Tell Me Who to Follow! Field Experiment Evidence on Voluntary Donations

    Get PDF
    We conducted a field experiment in a protected area to explore the effects of conformity to a social reference versus a comparable, but imposed, suggested donation. As observed before, we see visitors conforming to the changing social reference. On the other hand, the treatment in which we suggested a donation resulted in lower shares of visitors donating, compared to the social reference treatment, and lower conditional donations even compared to the control. We concluded that visitors look at their peers as a reference to conform to, but partially reject being confronted with an imposed suggestion on how to behave.conformity, donation, field experiment

    A variant of the multi-agent rendezvous problem

    Full text link
    The classical multi-agent rendezvous problem asks for a deterministic algorithm by which nn points scattered in a plane can move about at constant speed and merge at a single point, assuming each point can use only the locations of the others it sees when making decisions and that the visibility graph as a whole is connected. In time complexity analyses of such algorithms, only the number of rounds of computation required are usually considered, not the amount of computation done per round. In this paper, we consider Ω(n2logn)\Omega(n^2 \log n) points distributed independently and uniformly at random in a disc of radius nn and, assuming each point can not only see but also, in principle, communicate with others within unit distance, seek a randomised merging algorithm which asymptotically almost surely (a.a.s.) runs in time O(n), in other words in time linear in the radius of the disc rather than in the number of points. Under a precise set of assumptions concerning the communication capabilities of neighboring points, we describe an algorithm which a.a.s. runs in time O(n) provided the number of points is o(n3)o(n^3). Several questions are posed for future work.Comment: 18 pages, 3 figures. None of the authors has any previous experience in this area of research (multi-agent systems), hence we welcome any feedback from specialist

    The Hegselmann-Krause dynamics on the circle converge

    Full text link
    We consider the Hegselmann-Krause dynamics on a one-dimensional torus and provide the first proof of convergence of this system. The proof requires only fairly minor modifications of existing methods for proving convergence in Euclidean space.Comment: 9 pages, 2 figures. Version 2: A small error in the proof of Theorem 1.1 is corrected and an acknowledgement added. Bibliography update

    The "No Justice in the Universe" phenomenon: why honesty of effort may not be rewarded in tournaments

    Get PDF
    In 2000 Allen Schwenk, using a well-known mathematical model of matchplay tournaments in which the probability of one player beating another in a single match is fixed for each pair of players, showed that the classical single-elimination, seeded format can be "unfair" in the sense that situations can arise where an indisputibly better (and thus higher seeded) player may have a smaller probability of winning the tournament than a worse one. This in turn implies that, if the players are able to influence their seeding in some preliminary competition, situations can arise where it is in a player's interest to behave "dishonestly", by deliberately trying to lose a match. This motivated us to ask whether it is possible for a tournament to be both honest, meaning that it is impossible for a situation to arise where a rational player throws a match, and "symmetric" - meaning basically that the rules treat everyone the same - yet unfair, in the sense that an objectively better player has a smaller probability of winning than a worse one. After rigorously defining our terms, our main result is that such tournaments exist and we construct explicit examples for any number n >= 3 of players. For n=3, we show (Theorem 3.6) that the collection of win-probability vectors for such tournaments form a 5-vertex convex polygon in R^3, minus some boundary points. We conjecture a similar result for any n >= 4 and prove some partial results towards it.Comment: 26 pages, 2 figure
    corecore