Die Bereitstellung von Betreuungsplätzen für Kinder unter drei Jahren ist ein wichtiger Beitrag zur Verbesserung der Vereinbarkeit von Familie und Beruf. Seit dem 1. August 2013 haben Eltern in Deutschland einen Rechtsanspruch auf die Betreuung. Aber nicht allein die Bereitstellung einer...

The purpose of this paper is to formulate and study a game where there is a player who is involved for a long time interval and several small players who stay in the game for short time intervals. Examples of such games abound in practice. For example a Bank is a long-term player who stays in...

We develop a theory of stability in many-to-many matching markets. We give conditions under which the setwise-stable set, a core-like concept, is nonempty and can be approached through an algorithm. The usual core may be empty. The setwise-stable set coincides with the pairwise-stable set and...

A key to the Coase conjecture is the monopolist's inability to commit to a price, which leads consumers to believe that a high current price will be followed by low future prices. This paper studies the robustness of the Coase conjecture with respect to these beliefs of consumers. In particular,...

This paper formally examines two competing methods of conducting a lottery in assigning students to schools, motivated by the design of the centralized high school student assignment system in New York City. The main result of the paper is that a single and multiple lottery mechanism are...

We consider Bayesian incentive-compatible mechanisms with independent types and either private values or interdependent values that satisfy a form of "congruence." We show that in these settings, interim participation constraints are satisfied when the status quo is the randomized allocation...

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

Axiomatic bargaining theory (e.g., Nash's theorem) is static. We attempt to provide a dynamic justification for the theory. Suppose a Judge or Arbitrator must allocate utility in an (infinite) sequence of two-person problems; at each date, the Judge is presented with a utility possibility set in...

We adopt the notion of von Neumann-Morgenstern (vNM) farsightedly stable sets to determine which matchings are possibly stable when agents are farsighted in one-to-one matching problems. We provide the characterization of vNM farsightedly stable sets: a set of matchings is a vNM farsightedly...

We study a decision maker (DM) who has preferences over choice problems, which are sets of payoff-allocations between herself and a passive recipient. An example of such a set is the collection of possible allocations in the classic dictator game. The choice of an allocation from the set is...