Microsoft PowerPoint - lecture12.ppt [Compatibility Mode]
cs.cmu.edu · 1,845 words · saved by 1 readers
N/A
15-251 15-251 Great Theoretical Ideas in Computer Science Dating for Computer Scientists The Mathematics Of 1950’s Dating: Who wins The Battle of The Sexes? WARNING: This lecture Lecture 12 (October 6, 2009) contains mathematical content that may be shocking to some students…
related reading
- The stable marriage problemacotra.substack.com
- The stable marriage problemsubstack.com
- Gale–Shapley algorithm - Wikipediaen.wikipedia.org
- The Matching Problem in Dating - Erik Torenbergeriktorenberg.substack.com
- She's the One - by Bryan Caplan - Bet On Itbetonit.ai
- When should you settle down? |ideas.ted.com
- Bradley–Terry model - Wikipediaen.wikipedia.org
- Arrow's impossibility theorem - Wikipediaen.wikipedia.org
- The Marriage Decision: Everything Forever or Nothing Ever Againwaitbutwhy.com
- Student of Desirethepointmag.com
- In Defense Of Knowing Who You're Datingastralcodexten.substack.com
- How To Choose A Romantic Partnerrobkhenderson.com