Understanding Stable Matchings: A Non-Cooperative Approach
ثبت نشده
چکیده
We present a series of non-cooperative games with monotone best replies whose set of Nash equilibria coincides with the set of stable matchings. Key features of stable matchings are established as familiar properties of games with monotone best replies. Then we present a sense in which our method is necessary for the monotonicity approach. We also establish the connection of our approach with other monotone methods in the literature. JEL Classification Numbers: C70, D61, D63.
منابع مشابه
Using game theory approach to interpret stable policies for Iran’s oil and gas common resources conflicts with Iraq and Qatar
Oil and gas as the non-renewable resources are considered very valuable for the countries with petroleum economics. These resources are not only diffused equally around the world, but also they are common in some places which their neighbors often come into conflicts. Consequently, it is vital for those countries to manage their resource utilization. Lately, game theory was applied in conflict ...
متن کاملCooperative aggregate production planning: a game theory approach
Production costs in general, and workforce and inventory costs in particular, constitute a large fraction of the operating costs of many manufacturing plants. We introduce cooperative aggregate production planning as a way to decrease these costs. That is, when production planning of two or more facilities (plants) is integrated, they can interchange workforce and products inventory; thus, thei...
متن کاملProperties of Stable Matchings
Stable matchings were introduced in 1962 by David Gale and Lloyd Shapley to study the college admissions problem. The seminal work of Gale and Shapley has motivated hundreds of research papers and found applications in many areas of mathematics, computer science, economics, and even medicine. This thesis studies stable matchings in graphs and hypergraphs. We begin by introducing the work of Gal...
متن کاملThe Stable Matching Linear Program and an Approximate Rural Hospital Theorem with Couples
The deferred acceptance algorithm has been the most commonly studied tool for computing stable matchings. An alternate less-studied approach is to use integer programming formulations and linear programming relaxations to compute optimal stable matchings. Papers in this area tend to focus on the simple ordinal preferences of the stable marriage problem. This paper advocates the use of linear pr...
متن کاملSequences in Pairing Problems: A New Approach to Reconcile Stability with Strategy-Proofness for Elementary Matching Problems
We study two-sided (“marriage”) and general pairing (“roommate”) problems. We introduce “sequences,” lists of matchings that are repeated in order. Stable sequences are natural extensions of stable matchings; case in point, we show that a sequence of stable matchings is stable. In addition, stable sequences can provide solutions to problems for which stable matchings do not exist. In a sense, t...
متن کامل