In two-sided matching problems, we consider "natural" changes in prefer- ences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rank- enhancements of partners. One property requires that an agent who be-...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rankenhancements of partners. One property requires that an agent who becomes...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rankenhancements of partners. One property requires that an agent who becomes...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso-Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firms' reports following Milgrom (2010). We show...

In two-sided matching problems, we consider “natural” changes in preferences of agents in which only the rankings of current partners are enhanced. We introduce two desirable properties of matching rules under such rank-enhancements of partners. One property requires that an agent who...

We generalize a well-known Gale–Shapley algorithm [4] concerning optimal assignment of candidates to schools. In the classical Gale–Shapley model we consider a set of schools (colleges) S, a set of candidates K, candidates’ preferences in S and schools’ preferences in the set K...

This paper considers a resource allocation mechanism that utilizes a profit-maximizing auctioneer/matchmaker in the Kelso–Crawford (1982) (many-to-one) assignment problem. We consider general and simple (individualized price) message spaces for firmsʼ reports following Milgrom (2010). We show...

In this paper, we analyze capacity manipulation games in hospital-intern markets inspired by the real-life entry-level labor markets for young physicians seeking residencies at hospitals. In these markets, where the matching is determined by a centralized clearinghouse called the National...