A solution to matching with preferences over colleagues
From MaRDI portal
Publication:2371150
DOI10.1016/j.geb.2006.07.003zbMath1271.91084MaRDI QIDQ2371150
M. Bumin Yenmez, Federico Echenique
Publication date: 29 June 2007
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://resolver.caltech.edu/CaltechAUTHORS:20170808-153108432
stability; core; coalition formation; two-sided matching; college admission problem; simple matchings
91B68: Matching models
Related Items
Strategic Issues in One-to-One Matching with Externalities, Two-Sided Matching Models, Stable Matching in Large Economies, Review of the theory of stable matchings and contract systems, Stable matching: An integer programming approach, On the unique core partition of coalition formation games: correction to İnal (2015), Coalitional stability in matching problems with externalities and random preferences, Matching with aggregate externalities, Core of the assignment game via fixed point methods, Two-sided coalitional matchings, Competitive equilibria in Shapley-Scarf markets with couples, Core of coalition formation games and fixed-point methods, Finding all stable matchings with couples, Core stability and core selection in a decentralized labor matching market, Many-to-one matchings without substitutability, Constitutions and groups, Interdistrict school choice: a theory of student assignment, Stability in matching markets with peer effects, Contracts vs. preferences over colleagues in matching, Matching with preferences over colleagues solves classical matching, Downstream competition and upstream labor market matching, Refugee allocation in the setting of hedonic games, Incentives and implementation in marriage markets with externalities, School choice with neighbors, Many-to-one matching markets with externalities among firms, A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms, Status-seeking in hedonic games with heterogeneous players, Deferred acceptance algorithms: history, theory, practice, and open questions, Stable one-to-one matchings with externalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The stability of hedonic coalition structures
- Counting combinatorial choice rules
- New maximal numbers of equilibria in bimatrix games
- Stability of matchings when individuals have preferences over colleagues
- Mixed equilibria in games of strategic complementarities
- An algorithm to compute the full set of many-to-many stable matchings.
- Stable matchings and preferences of couples
- Core many-to-one matchings by fixed-point methods
- On a characterization of stable matchings
- Core in a simple coalition formation game
- The communication requirements of social choice rules and supporting budget sets
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- The Economics of Matching: Stability and Incentives
- Job Matching, Coalition Formation, and Gross Substitutes
- A Fixed-Point Approach to Stable Matchings and Some Applications
- College Admissions and the Stability of Marriage