This paper considers a decentralized process in many-to-many matching problems. We show that if agents on one side of the market have substitutable preferences and those on the other side have responsive preferences, then, from an arbitrary matching, there exists a finite path of matchings such...

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

In most variants of the Hotelling-Downs model of election, it is assumed that voters have concave utility functions. This assumption is arguably justied in issues such as economic policies, but convex utilities are perhaps more appropriate in others such as moral or religious issues. In this...

In costly voting models, voters abstain when a stochastic cost of voting exceeds the benefit from voting. In probabilistic voting models, they always vote for a candidate who generates the highest utility, which is subject to random shocks. We prove an equivalence result: In two-candidate...

Many real matching markets are subject to distributional constraints. These constraints often take the form of restrictions on the numbers of agents on one side of the market matched to certain subsets on the other side. Real-life examples include restrictions on regions in medical matching,...

Stability is a central concept in matching theory, while nonbossiness is important in many allocation problems. We show that these properties are incompatible: there does not exist a matching mechanism that is both stable and nonbossy.

This paper investigates a jury decision when hung juries and retrials are possible. When jurors in subsequent trials know that previous trials resulted in hung juries, informative voting cannot be an equilibrium regardless of voting rules unless the probability that each juror receives the...

The deferred acceptance algorithm is often used to allocate indivisible objects when monetary transfers are not allowed. We provide two characterizations of agent-proposing deferred acceptance allocation rules. Two new axioms-individually rational monotonicity and weak Maskin monotonicity-are...