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

This paper inspires from a real-life assignment problem faced by the Mexican Ministry of Public Education. We introduce a dynamic school choice problem that consists in assigning positions to overlapping generations of teachers. From one period to another, teachers can either retain their...

We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable...

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

When members of a voting body exhibit single peaked preferences, pair-wise majority voting equilibria (Condorcet winners) always exist. Moreover, they coincide with the median(s) of the votersʼ most preferred alternatives. This important fact is known as the median voter result. Variants of it...

We offer complete characterizations of the equilibrium outcomes of two prominent agenda voting institutions that are widely used in the democratic world: the amendment, also known as the Anglo-American procedure, and the successive, or equivalently the Euro-Latin procedure. Our axiomatic...

The division problem under constraints consists of allocating a given amount of an homogeneous and perfectly divisible good among a subset of agents with single-peaked preferences on an exogenously given interval of feasible allotments. We characterize axiomatically the family of extended...

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

We consider full implementation in complete-information environments when agents have an arbitrarily small preference for honesty. We offer a condition called separable punishment and show that when it holds and there are at least two agents, any social choice function can be implemented by a...

An aggregation rule maps each profile of individual strict preference orderings over a set of alternatives into a social ordering over that set. We call such a rule strategy-proof if misreporting one's preference never produces a different social ordering that is between the original ordering...