In this paper we provide two simple new versions of Arrow's impossibility theorem, in a model with only one preference profile. Both versions are transparent, requiring minimal mathematical sophistication. The first version assumes there are only two people in society, whose preferences are...

The form of contests for a single fixed prize can be determined by a designer who maximizes the contestants' efforts. This paper establishes that, under common knowledge of the two asymmetric contestants' prize valuations, a fair Tullock-type endogenously determined lottery is always superior to...

Collective contests are examined permitting heterogeneity of stakes within every competing group. Our first concern is whether unequal distribution of stakes in a group can enhance its win probability. Our second concern is whether a large stake in a group can be individually disadvantageous. We...

Alienation to politics weakens political competition and can undermine the acceptance and legitimacy of democracy as a political system. Governance and representation problems at the local level cause part of citizens' lack of power and political alienation. Citizens have local power if they can...

The Borda Count (BC) is a positional voting procedure fairly often applied in nonpolitical choice settings. It has a usual mixture of good and bad theoretical properties. It is monotonic and consistent and excludes the election of an eventual Condorcet loser. It, however, does not necessarily...

We derive a necessary and a sufficient condition for Nash implementation with a procedurally fair mechanism. Our result has a nice analogue with the path-braking result of Maskin [Nash equilibrium and welfare optimality, Rev. Econ. Stud. 66 (1999) 23-38.], and therefore, it allows us to give a...

Recent developments in voting theory show that Condorcet profiles embedded in electoratesare responsible for conflicts between pairwise voting methods and for reversals ofrankings under positional methods whenever candidates are dropped or added. Because ofthe strong symmetry of the rankings of...

In this paper we provide two simple new versions of Arrow’s impossibility theorem, in a model with only one preference profile. Both versions are transparent, requiring minimal mathematical sophistication. The first version assumes there are only two people in society, whose preferences are...

We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive. Precisely, we prove that when either core stability or strict core stability is under...

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