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

	TakisTao on Levon Khachatrian’s Memo…
	Margene on Some Philosophy of Scienc…
	Seth on Navier-Stokes Fluid Computers
	John Sidles on BosonSampling and (BKS) Noise…
	ashish soni on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Joseph Malkevitch on Navier-Stokes Fluid Computers
	gowers on Polymath5 – Is 2 logarit…
	John Sidles on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers
	Gil Kalai on Navier-Stokes Fluid Computers

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

Follow “Combinatorics and more”