Katalog GES



Of Stable Marriages and Graphs, and Strategy and Polytopes

This expository paper develops the principal known results (and some new ones) on the stable matchings of marriage games in the language of directed graphs. This both unifies and simplifies the presentation and renders it more symmetric. In addition, it yields a new algorithm and a new proof for... Full description

1st Person: Balinski, Michel
Additional Persons: Ratier, Guillaume
Source: in SIAM Review Vol. 39, No. 4 (1997), p. 575-604
More Articles
Type of Publication: Article
Language: English
Published: 1997
Keywords: marriage problem
stable matching
graph
polytope
game
two-sided market
Online: Volltext
  Search for full text
LEADER 01969nma a2200517 c 4500
001 JST081688164
003 DE-601
005 20180606161603.0
007 cr uuu---uuuuu
008 150325s1997 000 0 eng d
024 8 |a 2132692 
035 |a 2132692 
040 |b ger  |c GBVCP 
041 0 |a eng 
084 |a 90C27  |2 MSC 
084 |a 05C90  |2 MSC 
084 |a 52B10  |2 MSC 
084 |a 90D40  |2 MSC 
084 |a PII: S0036144595294515  |2 MSC 
100 1 |a Balinski, Michel 
245 1 0 |a Of Stable Marriages and Graphs, and Strategy and Polytopes  |h Elektronische Ressource 
300 |a Online-Ressource 
500 |a Copyright: Copyright 1997 Society for Industrial and Applied Mathematics 
520 |a This expository paper develops the principal known results (and some new ones) on the stable matchings of marriage games in the language of directed graphs. This both unifies and simplifies the presentation and renders it more symmetric. In addition, it yields a new algorithm and a new proof for the existence of stable matchings, new proofs for many known facts, and some new results (notably concerning players' strategies and the properties of the stable matching polytope). 
611 2 7 |a research-article  |2 gnd 
650 7 |a marriage problem  |2 gnd 
650 7 |a stable matching  |2 gnd 
650 7 |a graph  |2 gnd 
650 7 |a polytope  |2 gnd 
650 7 |a game  |2 gnd 
650 7 |a two-sided market  |2 gnd 
689 0 0 |A f  |a research-article 
689 0 |5 DE-601 
689 1 0 |A s  |a marriage problem 
689 1 1 |A s  |a stable matching 
689 1 2 |A s  |a graph 
689 1 3 |A s  |a polytope 
689 1 4 |A s  |a game 
689 1 5 |A s  |a two-sided market 
689 1 |5 DE-601 
700 1 |a Ratier, Guillaume 
773 0 8 |i in  |t SIAM Review  |g Vol. 39, No. 4 (1997), p. 575-604  |q 39:4<575-604  |w (DE-601)JST081627106  |x 1095-7200 
856 4 1 |u https://www.jstor.org/stable/2132692  |3 Volltext 
912 |a GBV_JSTOR 
951 |a AR 
952 |d 39  |j 1997  |e 4  |h 575-604 

Similar Items

Cannot find similar records

Library Services

Search Options

Quick links

Orientation