We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

We consider a many-to-many matching problem with a priority structure such as the one in undergraduate course allocation. In order to incorporate course priorities, we develop a deterministic pseudo-market mechanism with priority-specific prices that is based on the approximate competitive...

We study a new variant of the school choice problem in which capacities can be altered by distributing additional seats across schools in response to students’ reported preferences. We show that heuristics solutions to this capacity design problem can be inefficient, even if they focus on...

We study a large market model of dynamic matching with no monetary transfers and a continuum of agents. Time is discrete and horizon finite. Agents are in the market from the first date and, at each date, have to be assigned items (or bundles of items). When the social planner can only elicit...

In some labour markets, firms and workers are constrained to match with each other via intermediaries that mutually connect them. We study these markets via a model that synthesises tripartite matching with a `trading network' feature, by formulating a simple agency game in which intermediaries...

We introduce a general class of simplicity standards that vary the foresight abilities required of agents in extensive-form games. Rather than planning for the entire future of a game, agents are presumed to be able to plan only for those histories they view as simple from their current...

In priority-based two-sided matchings, a respecting-improvements property of a mechanism requires that an agent should get weakly better off when she is assigned a higher priority. Not only is it a normative desideratum, it is also important for ex-ante investments and for disclosure of...

We incorporate externalities into the stable matching theory of two-sided markets. Extending the classical substitutes condition to markets with externalities, we establish that stable matchings exist when agent choices satisfy substitutability. We show that substitutability is a necessary...

Vulnerability to manipulation is a threat to successful matching market design. However, some manipulation is often inevitable and the mechanism designer wants to compare manipulable mechanisms and pick the best. Real-life examples include reforms in the entry-level medical labor market in the...

We consider a reallocation problem with priorities where each agent is initially endowed with a house and is willing to exchange it but each house has a priority ordering over the agents of the market. In this setting, it is well known that there is no individually rational and stable mechanism....