Matching with Preferences over Colleagues Solves Classical Matching

Scott Duke Kominers

Article | Games and Economic Behavior | March 2010

Matching with Preferences over Colleagues Solves Classical Matching

Abstract

In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences over colleagues" is actually more difficult than the classical many-to-one matching problem, "matching without preferences over colleagues." We give an explicit reduction of any problem of the latter type to a problem of the former type. This construction leads to the first algorithm which finds all stable matchings in the setting of "matching without preferences over colleagues," for any set of preferences. Our construction directly extends to generalized matching settings.

Keywords: Two-Sided Platforms; Balance and Stability; Mathematical Methods;

Format: Print

Find at Harvard Read Now

Citation:

Kominers, Scott Duke. "Matching with Preferences over Colleagues Solves Classical Matching." Games and Economic Behavior 68, no. 2 (March 2010): 773–780.

The U.S. residential real estate agency market presents a puzzle for economic theory: commissions on real estate transactions have remained constant and high for decades even though agent entry is frequent and agents’ costs of providing service are low. We model the real estate agency market, and other brokered markets, via repeated extensive form games; in our game, brokers first post prices for customers and then choose which agents on the other side of the market to work with. We show that prices appreciably higher than the competitive prices can be sustained (for a fixed discount factor) regardless of the number of brokers; this is done through strategies that condition willingness to transact with each broker on that broker’s initial posted prices. Our results can thus rationalize why brokered markets exhibit pricing high above marginal cost despite fierce competition for customers; moreover, our model can help explain why agents and platforms who have tried to reduce commissions have had trouble entering the market.

We introduce a new model of school choice with reserves in which a social planner is constrained by a limited supply of reserve seats and tries to find an optimal matching according to a social welfare function. We construct the optimal distribution of reserves via a quartic-time dynamic programming algorithm. Due to the modular nature of the dynamic program, the mechanism is strategy-proof for reserve-eligible students.

This case is set in mid-2019, when Qualcomm was struggling with unwanted takeover battles, fights with Apple and the Chinese government, and internal dissension on the board of directors. Ten years earlier Qualcomm was hailed as a monopoly on CDMA technologies and its derivatives—it appeared to be positioned to become the next dominant technology company in the tradition of Microsoft and Intel. But as the industry changed, Qualcomm’s competitive position seriously weakened. The purpose of the case is to explore central questions in strategy formulation: 1. how to build a long-term sustainable position based on technology, 2. how to design an IP strategy to lock in customers for the long run, 3. how to build a global standard and appropriate returns on that standard, and 4. how to respond when your historical business model starts to crumble.

Faculty & Research

Matching with Preferences over Colleagues Solves Classical Matching

Abstract

Citation:

About the Author

More from the Author