Nash equilibrium in stable matching problems

DOI10.3969/J.ISSN.0253-374X.2013.01.026MaRDI QIDQ2860080zbMATH OpenFDO

Authors Ye Wang, Yusheng Li

Publication date 19 November 2013

Published in Journal of Tongji University. Natural Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.0253-374X.2013.01.026

zbMATH Keywords

GS algorithmNash equilibriumstable matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90) General equilibrium theory (91B50)

Recommendations

• Ms. Machiavelli and the Stable Matching Problem
• Of Stable Marriages and Graphs, and Strategy and Polytopes
• Stable matchings and equilibrium outcomes of the Gale-Shapley's algorithm for the marriage problem
• On a characterization of stable matchings
• On the Nash equilibrium property of an auction matching game

Cited in

(5)

• On the Nash equilibrium property of an auction matching game
• A neural network approach to solve the stable matching problem
• Nash implementation of constrained efficient stable matchings under weak priorities
• Stable matching with network externalities
• The stability of the equilibrium outcomes in the admission games induced by stable matching rules

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Nash equilibrium in stable matching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860080)