Agents with single-peaked preferences share a resource coming from different suppliers; each agent is connected to only a subset of suppliers. Examples include workload balancing, sharing earmarked funds, and rationing utilities after a storm.

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

I consider whether the agentsʼ reluctance to make a large lie is helpful for the rule designer to construct a nonmanipulable rule. For this purpose, I study an axiom, called AM-proofness, saying that manipulation cannot occur through preferences adjacent to the sincere one. Through examples, I...

This paper considers marriage problems, roommate problems with nonempty core, and college admissions problems with responsive preferences. All stochastically stable matchings are shown to be contained in the set of matchings which are most robust to one-shot deviation.

We experimentally investigate the effects of group size on behavior and outcomes in a multilateral bargaining game. Using a Baron–Ferejohn protocol, our main interest is in the extent of costly delay (number of bargaining rounds needed to reach agreement). We investigate the effects of group...

We provide a short proof for the following characterization of the core in housing markets first proved by Ma (1994): the core is the only rule that satisfies strategy-proofness, Pareto efficiency and individual rationality.

Public school systems generally use one of the three competing mechanisms – the Boston mechanism, the deferred acceptance mechanism and the top trading cycle mechanism – for assigning students to specific schools. Although the literature generally claims that the Boston mechanism is Pareto...

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 problems of allocating objects among people. Some objects may be initially owned and the rest are unowned. Each person needs exactly one object and initially owns at most one object. We drop the common assumption of strict preferences. Without this assumption, it suffices to study...