Stable matching problem: Difference between revisions

Revision as of 14:42, 11 April 2020

Revision as of 01:21, 3 August 2020

Line 153:

{{reflist|40em}}

==Further reading==

===Textbooks and other important references not cited in the text===

{{refbegin}}

* 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/].

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

Line 162 ⟶ 161:

* 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}}.

{{refend}}

==External links==