Stable matching problem: Difference between revisions

Revision as of 01:21, 3 August 2020

Revision as of 01:27, 3 August 2020

Line 155:

==Further reading==

* Kleinberg, J., and Tardos, E. (2005) ''Algorithm Design'', Chapter 1, pp 1–12. See companion website for the Text [http://www.aw-bc.com/info/kleinberg/].

* [[{{cite book |authorlink=Donald Knuth |last=Knuth, |first=D. E.]] (|year=1996) ''|title=Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms'', |others=English translation, (|series=CRM Proceedings and Lecture Notes), |publisher=American Mathematical Society. }}

* [[Donald Knuth|Knuth, D. E.]] (1976). ''Mariages stables''. Montreal: Les Presses de l'Universite de Montreal.

* {{cite journal |last=Pittel, |first=B. (|year=1992). "|title=On likely solutions of a stable marriage problem", |journal=[[The Annals of Applied Probability]] |volume=2; |pages=358-401. |jstor=2959755 }}

* [[Donald Knuth|Knuth, D.E.]] (1996) ''Stable Marriage and Its Relation to Other Combinatorial Problems: An Introduction to the Mathematical Analysis of Algorithms'', English translation, (CRM Proceedings and Lecture Notes), American Mathematical Society.

* {{cite journal |last=Roth, |first=A. E. (|year=1984). "|title=The evolution of the labor market for medical interns and residents: A case study in game theory", |journal=[[Journal of Political Economy]] |volume=92: |issue=6 |pages=991–1016 |doi=10.1086/261272 }}

* Pittel, B. (1992). "On likely solutions of a stable marriage problem", [[The Annals of Applied Probability]] 2; 358-401.

* {{cite book | last1=Roth, |first1=A. E., and |last2=Sotomayor, |first2=M. A. O. (|year=1990) ''|title=Two-sided matching: A study in game-theoretic modeling and analysis'' |publisher=[[Cambridge University Press]]. }}

* Roth, A. E. (1984). "The evolution of the labor market for medical interns and residents: A case study in game theory", [[Journal of Political Economy]] 92: 991–1016.

* Roth, A. E., and Sotomayor, M. A. O. (1990) ''Two-sided matching: A study in game-theoretic modeling and analysis'' [[Cambridge University Press]].

* {{cite book | last1=Shoham | first1=Yoav | last2=Leyton-Brown | first2=Kevin | title=Multiagent Systems: Algorithmic, Game-Theoretic, and Logical Foundations | publisher=[[Cambridge University Press]] | isbn=978-0-521-89943-7 | url=http://www.masfoundations.org | year=2009 | ___location=New York}} See Section 10.6.4; [http://www.masfoundations.org/download.html downloadable free online].

* {{cite book|author1=Schummer, J.|author2=Vohra, R. V.| isbn = 978-0521872829 |chapter=Mechanism design without money| title = Algorithmic Game Theory | editor1-last = Nisan | editor1-first= Noam |year=2007 | chapter-url = http://www.cambridge.org/journals/nisan/downloads/Nisan_Non-printable.pdf | editor2-last = Roughgarden | editor2-first= Tim | editor3-last = Tardos | editor3-first= Eva | editor4-last = Vazirani | editor4-first= Vijay | pages = 255–262}}