We propose a dynamic model of decentralized many-to-one matching in the context of a competitive labor market. Through wage offers and wage demands, firms compete over workers and workers compete over jobs. Firms make hire-and-fire decisions dependent on the wages of their own workers and on the...

This paper studies the problem of assigning a set of indivisible objects to a set of agents when monetary transfers are not allowed and agents reveal only ordinal preferences, but random assignments are possible. We offer two characterizations of the probabilistic serial mechanism, which assigns...

We develop observable restrictions of well-known theories of bargaining over money. We suppose that we observe a finite data set of bargaining outcomes, including data on allocations and disagreement points, but no information on utility functions. We ask when a given theory could generate the...

In a matching problem between students and schools, a mechanism is said to be robustly stable if it is stable, strategy-proof, and immune to a combined manipulation, where a student first misreports her preferences and then blocks the matching that is produced by the mechanism. We find that even...

In this article, we analyze the stability of couples on the marriage market. Recent developments in cooperative game theory allow a new model that uses team games which make it possible to model the marriage market. Coalition structures can model couples. We analyze two cases: a symmetrical one...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

Strategy‐proofness (SP) is a sought‐after property in social choice functions because it ensures that agents have no incentive to misrepresent their private information at both the interim and ex post stages. Group strategy‐proofness (GSP), however, is a notion that is applied to the ex...

The Nash program is an important research agenda initiated in Nash (Econometrica 21:128-140, 1953) in order to bridge the gap between the noncooperative and cooperative counterparts of game theory. The program is thus turning sixty-seven years old, but I will argue it is not ready for...

In the present work, agreement on allocation of payments from multiple issues requires unanimous consent of all parties involved. The agents are assumed to know the aggregate payoffs but do not know their decomposition by issues. This framework applies to many real-world problems, such as the...

A new mechanism was introduced in New York City and Boston to assign students to public schools. This mechanism was advocated for its superior fairness property, besides others. We introduce a new framework for school-choice problems and two notions of fairness in lottery design based on ex-ante...