We propose a smooth multibidding mechanism for environments where a group of agents have to choose one out of several projects. Our proposal is related to the multibidding mechanism (Pérez-Castrillo and Wettstein, 2002) but it is “smoother” in the sense that small variations in an agentʼs...

We generalize the dynamic bargaining game of Diermeier and Fong (2011) to arbitrary quota rules to provide a non-cooperative characterization of the von Neumann–Morgenstern stable set. Assuming that players are sufficiently patient and have strict preferences, a pure-strategy stationary...

We consider the optimization problem of a campaign trying to win an election when facing aggregate uncertainty, where agentsʼ voting probabilities are uncertain. Even a small amount of uncertainty will in a large electorate eliminate many of counterintuitive results that arise when voting...

In a common-values election where voters receive a signal about which candidate is superior, suppose there is a small amount of uncertainty about the conditional likelihood of the signalʼs outcome, given the correct candidate. Once this uncertainty is resolved, the signal is i.i.d. across...

We study an election with two perfectly informed candidates. Voters share common values over the policy outcome of the election, but possess arbitrarily little information about which policy is best for them. Voters elect one of the candidates, effectively choosing between the two policies...

This paper introduces a model of electoral competition in which candidates select policies and voters are then exposed to arguments in favor of the policies. Voters update their beliefs about their own private preferences after listening to arguments and then vote in the election. I show that...

We consider a mechanism design problem in economies with increasing returns. We construct a new class of rules, called w-hybrid rules, and characterize them by strategy-proofness, anonymity, envy-freeness, consumer sovereignty, and non-bossiness. We show that w-hybrid rules improve the supremal...

This paper shows that in private value environments, strategy-proofness and the rectangular property are necessary conditions for (full) robust implementation (Bergemann and Morris, 2011). As corollaries, we obtain the equivalence between robust and secure implementation (Saijo et al., 2007),...

We study desirability axioms imposed on allocations in indivisible object allocation problems. The existing axioms in the literature are various conditions of robustness to blocking coalitions with respect to agentsʼ ex ante (individual rationality and group rationality) and ex post (Pareto...

Sortition is the process of selecting decision makers or senators by a lottery. We introduce sortition in implementation theory by augmenting a mechanism with a kleroterion or lottery machine p that selects the senators. An outcome is implemented after consulting only the opinions of the...