Tag Archives: Sanjeev Motwani

Test Your Intuition (19): The Advantage of the Proposers in the Stable Matching Algorithm

Posted on April 9, 2013 by Gil Kalai

Stable mariage The Gale-Shapley stable matching theorem and the algorithm. GALE-SHAPLEY THEOREM Consider a society of n men and n women and suppose that every man [and every woman] have a preference (linear) relation on the women [men] he [she] knows. Then … Continue reading →

Posted in Combinatorics, Games, Probability, Test your intuition | Tagged Boris Pittel, David Gale, Donald Knuth, Lloyd Shapley, Sanjeev Motwani, Stable-marriage, Test your intuition | 7 Comments

	fedja on Chess can be a Game of Lu…
	qm computing summer… on The Race to Quantum Technologi…
	Murat Aygen on Remote Blogging: Efficiency of…
	Gil Kalai on Chess can be a Game of Lu…
	fedja on Chess can be a Game of Lu…
	Solvig Kadison-Singe… on The Kadison-Singer Conjecture…
	Matthew Cory on Call for nominations for the O…
	Matthew Cory on The Race to Quantum Technologi…
	domotorp on Chess can be a Game of Lu…
	Gil Kalai on The Race to Quantum Technologi…
	Notes of the seminar… on Mind Boggling: Following the w…
	Optimal Colorful Tve… on Seven Problems Around Tverberg…

Tag Archives: Sanjeev Motwani

Test Your Intuition (19): The Advantage of the Proposers in the Stable Matching Algorithm

Recent Comments

Recent Posts

Top Posts & Pages

RSS

Categories

Blogroll

Archives