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
- Love is not a math problem - by Gonzalo Nuñezgonzalonunez.substack.com
- Game theory explains dinner-party dates.slate.com
- The Matching Problem in Dating - Erik Torenbergeriktorenberg.substack.com
- When should you settle down? |ideas.ted.com
- Dating: a Research Journal, Part 3 – PUTANUMONITputanumonit.com
- Dating: a Research Journal, Part 1 – PUTANUMONITputanumonit.com
- Dating Roundup #3: Third Time's the Charmthezvi.substack.com
- Competitive Programmer's Handbookcses.fi
- Mathematics for Computer Sciencepeople.csail.mit.edu
- Gale–Shapley algorithm - Wikipediaen.wikipedia.org