Alesina and Tabellini (2007) investigate the normative criteria for allocating policy tasks to bureaucrats versus politicians. While they establish criteria with respect to a number of parameters, they do not give a criterion with respect to the degree of imperfect monitoring. We establish an...

In the college admission problem, we show that the student-optimal stable matching is weakly Pareto optimal for students if colleges' preferences satisfy substitutability and the law of aggregate demand. We also show that both of these properties are important for the result.

A number of labor markets and student placement systems can be modeled as many-to-one matching markets. We analyze the scope for manipulation in many-to-one matching markets under the student-optimal stable mechanism when the number of participants is large. Under some regularity conditions, we...

The random priority (random serial dictatorship) mechanism is a common method for assigning objects to individuals. The mechanism is easy to implement and strategy-proof. However this mechanism is inefficient, as the agents may be made all better off by another mechanism that increases their...

We study the effect of different school choice mechanisms on schools' incentives for quality improvement. To do so, we introduce the following criterion: A mechanism respects improvements of school quality if each school becomes weakly better off whenever that school becomes more preferred by...

Real matching markets are subject to constraints. For example, the Japanese government introduced a new medical matching system in 2009 that imposes a "regional cap" in each of its 47 prefectures, which regulates the total number of medical residents who can be employed in each region. Based on...