A collective decision problem is described by a set of agents, a profile of single-peaked preferences over the real line and a number of public facilities to be located. We consider public facilities that do not suffer from congestion and are non-excludable. We characterize the class of rules...

We investigate the emergence and enforcement of contribution norms to public goods in homogeneous and heterogeneous groups. With survey data we demonstrate that uninvolved individuals hold well defined yet conflicting normative views of fair contribution rules related to efficiency, equality,...

We propose the minimum approval mechanism (MAM) for a standard linear public good environment with two players. Players simultaneously and privately choose their contributions to the public good in the first stage. In the second stage, they simultaneously decide whether to approve the otherʼs...

We describe an experimental comparison of the out-of-equilibrium performance of three allocation mechanisms designed to achieve Lindahl outcomes as Nash equilibria: the mechanisms due to Walker (1981), Kim (1993), and Chen (2002). We find that Chenʼs mechanism, which is supermodular, converges...

Donations in-kind can be a mixed blessing for charities, who are often more adept at solicitation than resale. Many organizations rely on raffles to turn donations into cash, but auctions are also common. Theory predicts that all-pay mechanisms should produce more revenue than winner-pay...

We demonstrate that the Hotelling–Downs model with runoff voting always admits symmetric mixed strategy equilibria for any (even or odd) number of office-motivated candidates (provided they are at least four). In specific, (a) we show that the game does not admit any symmetric atomless...

We describe and characterize the family of asymmetric parametric division rules for the adjudication of conflicting claims on a divisible homogeneous good. As part of the characterization, we present two novel axioms which restrict how a division rule indirectly allocates between different...

Recently, Hermandez-Lamoneda et al. (2008) and independently Chameni and Andjiga (2008) gave an analytic formulation for all valued solutions to the n-person TU-games that satisfy linearity, efficiency and symmetry axioms. Our main purpose in this paper is to recast the proposed formulation to a...

We study the implementation problem when players are prone to make mistakes. To capture the idea of mistakes, Logit Quantal Response Equilibrium (LQRE) is used, and we consider a case in which players are almost rational, i.e., the sophistication level of players approaches infinity. We show...

Minimum cost spanning tree (mcst) problems try to connect agents efficiently to a source when agents are located at different points in space and the cost of using an edge is fixed. We introduce a new cost sharing solution that always selects a point in the core and that is more responsive to...