Ernest Davis
Abstract
The 37% rule is rarely applicable in real-world situations. It is certainly entirely wrong-headed as advice for getting married.
- Christian, B. and Griffiths, T. Algorithms to Live By: The Computer Science of Human Decisions. Henry Holt, 2016. Google Scholar
Digital Library
- Davis, E. The 37% Rule. 2017; http://cs.nyu.edu/faculty/davise/Verses/ThirtySeven.htmlGoogle Scholar
- Gardner, M. New Mathematical Diversions from Scientific American. Simon and Schuster, 1966.Google Scholar
- Krulwich, R. How to marry the right girl: A mathematical solution. National Public Radio, May 15, 2014.Google Scholar
- Parker, M. The secretary problem: An algorithm for deciding who to marry and other tough choices. Slate (Dec. 17, 2014).Google Scholar
- Swanson, A. When to stop dating and settle down, according to math. The Washington Post (Feb. 16, 2016).Google Scholar
- Weller, C. A mathematical theory says the perfect age to get married is 26---here's why. Business Insider (Nov. 25, 2016).Google Scholar
- Wikipedia. Secretary problem; http://en.wikipedia.org/wiki/Secretary_problemGoogle Scholar
Index Terms
- Lousy advice to the lovelorn
Recommendations
Advice to a Newbie: A koder with attitude, KV answers your questions. Miss Manners he ain’t.
DNSDear KV, I am new to programming and just started reading some books about programming, particularly C++ and Visual Basic. I truly enjoy programming a lot, to the extent that for the past couple of months I have never missed a day without writing some ...
Reactions on advice given by others on the business of becoming a researcher
CoNEXT Student '12: Proceedings of the 2012 ACM conference on CoNEXT student workshopIn past CoNext student workshops, Sue Moon and Jim Kurose gave excellent keynote talks on the business of becoming a researcher: what it means to do good research, how to pre- pare yourself, how to pick research topics, how to manage your adviser, and ...
Approximation algorithms that take advice
APPROX '00: Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial OptimizationMany recently designed approximation algorithms use a simple but apparently powerful idea. The algorithm is allowed to ask a trusted oracle for a small number (say O(log n)) bits of "advice." For instance, it could ask for O(log n) bits of the optimum ...
Comments