The common use of majority rule in group decision making is puzzling. In theory, it inequitably favors the proposer, and paradoxically, it disadvantages voters further if they are inequity averse. In practice, however, outcomes are equitable. The present paper analyzes data from a novel...

This study explores mechanism design with allocation-based social preferences. Agents’ social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents’ social...

This study explores mechanism design with allocation-based social preferences. Agents' social preferences and private payoffs are all subject to asymmetric information. We assume quasi-linear utility and independent types. We show how the asymmetry of information about agents' social preferences...

At each moment in time, some alternative from a finite set is selected by a dynamic process. Players observe the alternative selected and sequentially cast a yes or a no vote. If the set of players casting a yes-vote is decisive for the alternative in question, the alternative is accepted and...

A conclave is a voting mechanism in which a committee selects an alternative by voting until a sufficient supermajority is reached. We study experimentally welfare properties of simple three-voter conclaves with privately known preferences over two outcomes and waiting costs. The resulting game...

We study communication in committees selecting one of two alternatives when consensus is required and agents have private information about their preferences. Delaying the decision is costly, so a form of multiplayer war of attrition emerges. Waiting allows voters to express the intensity of...

We study communication in committees selecting one of two alternatives when consensus is required and agents have private information about their preferences. Delaying the decision is costly, so a form of multiplayer war of attrition emerges. Waiting allows voters to express the intensity of...

I prove that there exists no assignment mechanism that is strategy-proof, non-wasteful and satisfies equal treatment of equals. This strengthens the impossibility result of Bogomolnaia and Moulin (2001) by weakening their assumption of ordinal efficiency to non-wastefulness. My result solves an...

We study the slot allocation problem where agents have quasi-linear single-peaked preferences over slots and identify the rules satisfying efficiency, strategy-proofness, and individual rationality. Since the quasi-linear single-peaked domain is not connected, the famous characterization of the...

The study of matching problems typically assumes that agents precisely know their preferences over the goods to be assigned. Within applied contexts, this assumption stands out as particularly counterfactual. Parents typically do invest a large amount of time and resources to find the best...