Stability in repeated matching markets
From MaRDI portal
Publication:6180420
Abstract: This paper develops a framework for repeated matching markets. The model departs from the Gale-Shapley matching model by having a fixed set of long-lived hospitals match with a new generation of short-lived residents in every period. I show that there are two kinds of hospitals in this repeated environment: some hospitals can be motivated dynamically to voluntarily reduce their hiring capacity, potentially making more residents available to rural hospitals; the others, however, are untouchable even with repeated interaction and must obtain the same match as they do in a static matching. In large matching markets with correlated preferences, at most a vanishingly small fraction of the hospitals are untouchable. The vast majority of hospitals can be motivated using dynamic incentives.
Recommendations
Cites work
- A dynamic model of barter exchange
- A finite decentralized marriage market with bilateral search
- A one-shot deviation principle for stability in matching problems
- A Solution Concept for Majority Rule in Dynamic Settings
- College Admissions and the Stability of Marriage
- Cooperation in the Prisoner's Dilemma with Anonymous Random Matching
- Cooperation with network monitoring
- Core in a simple coalition formation game
- Directed Matching and Monetary Exchange
- Discounted Dynamic Programming
- Dynamic kidney exchange
- Dynamically stable matching
- scientific article; zbMATH DE number 1099363 (Why is no real title available?)
- Incentive compatibility of large centralized matching markets
- Multiperiod matching
- On likely solutions of a stable marriage problem
- On the uniqueness of stable marriage matchings
- Payoff equivalence of efficient mechanisms in large matching markets
- Perfect public equilibrium when players are patient
- Repeated Games with Long-Run and Short-Run Players
- Social Norms and Community Enforcement
- Stability and preference alignment in matching and coalition formation
- Stability in dynamic matching markets
- The "Folk Theorem" for Repeated Games with Complete Information
- The Average Number of Stable Matchings
- The Folk Theorem for Repeated Games: A Neu Condition
- The folk theorem in repeated games with anonymous random matching
- The Folk Theorem in Repeated Games with Discounting or with Incomplete Information
- Time horizons, lattice structures, and welfare in multi-period matching markets
Cited in
(5)
This page was built for publication: Stability in repeated matching markets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6180420)