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 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...

In this study we present a simple mechanism in a many-to-one matching market where multiple costless applications are allowed. The mechanism is based on the principles of eligibility and priority and it implements the set of stable matchings in Subgame Perfect Nash Equilibrium. We extend the...

We analyze the problem of a jury that must rank a set of contestants whose socially optimal ranking is common knowledge among jurors who may have friends among the contestants and may, therefore, be biased in their friends' favor. We show a natural mechanism that is finite and complete...

We compare competing college admission matching mechanisms that differ in preference submission timing (pre-exam, post-exam but pre-score, or post-score) and in matching procedure (Boston (BOS) and serial dictatorship (SD) matching). Pre-exam submission asks students to submit college...

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 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...

Most priority-based assignment problems are solved using the deferred acceptance algorithm. Kojima (2010) shows that stability and nonbossiness are incompatible. We show that the deferred acceptance algorithm satisfies a weaker notion of nonbossiness for every substitutable priority structure....

We study the classic implementation problem under the behavioral assumption that agents myopically adjust their actions in the direction of better-responses or best-responses. First, we show that a necessary condition for recurrent implementation in better-response dynamics (BRD) is a small...

We study resource allocation with multi-unit demand, such as the allocation of courses to students. In contrast to the case of single-unit demand, no stable mechanism, not even the (student-proposing) deferred acceptance algorithm, achieves desirable properties: it is not strategy-proof and the...