Probabilistic stable rules and Nash equilibrium in two-sided matching problems
From MaRDI portal
Publication:521881
DOI10.1007/s00182-015-0525-3zbMath1398.91460OpenAlexW2272261776MaRDI QIDQ521881
Publication date: 12 April 2017
Published in: International Journal of Game Theory (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/17195/1/17195.pdf
Inequalities; stochastic orderings (60E15) Noncooperative games (91A10) Individual preferences (91B08) Matching models (91B68)
Related Items (1)
Cites Work
- Unnamed Item
- A many-to-many `rural hospital theorem'
- Contract design and stability in many-to-many matching
- Misrepresentation and stability in the marriage problem
- The college admissions problem is not equivalent to the marriage problem
- Some remarks on the stable matching problem
- Ordinal Bayesian incentive compatible representations of committees
- Three remarks on the many-to-many stable matching problem
- Incentives in two-sided matching with random stable mechanisms
- Stable schedule matching under revealed preference.
- An algorithm to compute the full set of many-to-many stable matchings.
- Single agents and the set of many-to-one stable matchings
- A class of multipartner matching markets with a strong lattice structure
- Stable matchings and the small core in Nash equilibrium in the college admissions problem.
- Random matching in the college admissions problem
- Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration
- Stability and Polarization of Interests in Job Matching
- Random Paths to Stability in Two-Sided Matching
- The Lattice Structure of the Set of Stable Matchings with Multiple Partners
- Job Matching, Coalition Formation, and Gross Substitutes
- College Admissions and the Stability of Marriage
This page was built for publication: Probabilistic stable rules and Nash equilibrium in two-sided matching problems
