• Selected
• Entire List

Abstract:
This paper studies the payoff structure of stable cooperation structures in link formation games. Players choose non-cooperatively with whom they want to form a link, and the payoffs are given by the Myerson value of the cooperation structure obtained. We characterize the class of TU-games that ensure the stability of the full cooperation structure, which turns out to be much larger than the class of superadditive TU-games. We then provide an exact characterization of the Moderer and Shapley potential of the link formation game, and establish its equivalence with the potential as defined by Hart and Mas-Colell [Econometrica, 57 (1989), 589-614]. We use this result to show that stable but Pareto dominated graphs can emerge under simple best-response dynamics.

Cooperation structure, graph, Myerson value, stability, potential

Abstract:
This paper studies a decentralised job market model where firms (academic departments) propose sequentially a (unique) position to some workers (Ph.D. candidates). Successful candidates then decide whether to accept the offers, and departments whose positions remain unfilled propose to other candidates. We distinguish between several cases, depending on whether agents' actions are simultaneous and/or irreversible (if a worker accepts an offer he is immediately matched, and both the worker and the firm to which she is matched go out of the market). For all these cases, we provide a complete characterization of the Nash equilibrium outcomes and the Subgame Perfect equilibria. While the set of Nash equilibria outcomes contain all individually rational matchings, it turns out that in most cases considered all subgame perfect equilibria yield a unique outcome, the worker-optimal matching.

Two-sided matching, Job market, Subgame perfect equilibrium, irreversibilities

Abstract:
We consider non-cooperative environments in which two players have the power to commit but cannot sign binding agreements. We show that by committing to a set of actions rather than to a single action, players can implement a wide range of action profiles. We give a complete characterization of implementable profiles and provide a simple method to find them. Profiles implementable by bilateral commitments are shown to be generically inefficient. Surprisingly, allowing for gradualism (i.e., step by step commitment) does not change the set of implementable profiles.

Commitment, Self-enforcing, Treaties, Inefficiency, Agreements, Pareto-improvement

Abstract:
The literature on school choice assumes that families can submit a preference list over all the schools they want to be assigned to. However, in many real-life instances families are only allowed to submit a list containing a limited number of schools. Subjects' incentives are drastically affected, as more individuals manipulate their preferentes. Including a safety school in the constrained list explains most manipulations. Competitiveness across schools plays an important role. Constraining choices increases segregation and affects the stability and efficiency of the final allocation. Remarkably, the constraint reduces significantly the proportion of subjects playing a dominated strategy.

School Choice, Matching, Experiment, Gale-Shapley, Top Trading Cycles, Boston Mechanism, Efficiency, Stability, Truncation, Truthtelling, Safety School