Lucas, Richard E., Andrew E. Clark, Yannis Georgellis, and Ed Diener. “Reexamining Adaptation and the Set Point Model of Happiness: Reactions to Changes in Marital Status.” Journal of Personality and Social Psychology 84, no. 3 (2003): 527–539.
Lueker, George S. “Two NP-Complete Problems in Nonnegative Integer Programming.” Technical Report TR-178, Computer Science Laboratory, Princeton University, 1975.
Luria, Salvador E. A Slot Machine, a Broken Test Tube: An Autobiography. New York: Harper & Row, 1984.
MacQueen, J., and R. G. Miller. “Optimal Persistence Policies.” Operations Research 8 (1960): 362–380.
Malthus, Thomas Robert. An Essay on the Principle of Population. London: J. Johnson, 1798.
Marcus, Gary. Kluge: The Haphazard Evolution of the Human Mind. New York: Houghton Mifflin Harcourt, 2009.
Markowitz, Harry. “Portfolio Selection.” Journal of Finance 7, no. 1 (1952): 77–91.
______. Portfolio Selection: Efficient Diversification of Investments. New York: Wiley, 1959.
Martin, Thomas Commerford. “Counting a Nation by Electricity.” Electrical Engineer 12, no. 184 (1891): 521–530.
McCall, John. “Economics of Information and Job Search.” Quarterly Journal of Economics 84 (1970): 113–126.
McGrayne, Sharon Bertsch. The Theory That Would Not Die: How Bayes’ Rule Cracked the Enigma Code, Hunted Down Russian Submarines, & Emerged Triumphant from Two Centuries of Controversy. New Haven, CT: Yale University Press, 2011.
McGuire, Joseph T., and Joseph W. Kable. “Decision Makers Calibrate Behavioral Persistence on the Basis of Time-Interval Experience.” Cognition 124, no. 2 (2012): 216–226.
______. “Rational Temporal Predictions Can Underlie Apparent Failures to Delay Gratification.” Psychological Review 120, no. 2 (2013): 395.
Megiddo, Nimrod, and Dharmendra S. Modha. “Outperforming LRU with an Adaptive Replacement Cache Algorithm.” Computer 37, no. 4 (2004): 58–65.
Mellen, Andrew. Unstuff Your Life! Kick the Clutter Habit and Completely Organize Your Life for Good. New York: Avery, 2010.
Menezes, Alfred J., Paul C. Van Oorschot, and Scott A Vanstone. Handbook of Applied Cryptography. Boca Raton, FL: CRC Press, 1996.
Menger, Karl. “Das botenproblem.” Ergebnisse eines mathematischen kolloquiums 2 (1932): 11–12.
Metropolis, Nicholas, Arianna W. Rosenbluth, Marshall N. Rosenbluth, Augusta H. Teller, and Edward Teller. “Equation of State Calculations by Fast Computing Machines.” Journal of Chemical Physics 21, no. 6 (1953): 1087–1092.
Meyer, Robert J., and Yong Shi. “Sequential Choice Under Ambiguity: Intuitive Solutions to the Armed-Bandit Problem.” Management Science 41 (1995): 817–834.
Millard-Ball, Adam, Rachel R. Weinberger, and Robert C. Hampshire. “Is the Curb 80% Full or 20% Empty? Assessing the Impacts of San Francisco’s Parking Pricing Experiment.” Transportation Research Part A: Policy and Practice 63 (2014): 76–92.
Mischel, Walter, Ebbe B. Ebbesen, and Antonette Raskoff Zeiss. “Cognitive and Attentional Mechanisms in Delay of Gratification.” Journal of Personality and Social Psychology 21, no. 2 (1972): 204.
Mischel, Walter, Yuichi Shoda, and Monica I. Rodriguez. “Delay of Gratification in Children.” Science 244, no. 4907 (1989): 933–938.
Mitzenmacher, Michael, and Eli Upfal. Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge, UK: Cambridge University Press, 2005.
Monsell, Stephen. “Task Switching.” Trends in Cognitive Sciences 7, no. 3 (2003): 134–140.
Moore, Gordon E. “Cramming More Components onto Integrated Circuits.” Electronics Magazine 38 (1965): 114–117.
______. “Progress in Digital Integrated Electronics.” In International Electronic Devices Meeting 1975 Technical Digest, 1975, 11–13.
Moore, J. Michael. “An N Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs.” Management Science 15, no. 1 (1968): 102–109.
Morgenstern, Julie. Organizing from the Inside Out: The Foolproof System for Organizing Your Home, Your Office and Your Life. New York: Macmillan, 2004.
Moser, L. “On a Problem of Cayley.” Scripta Mathematica 22 (1956): 289–292.
Motwani, Rajeev, and Prabhakar Raghavan. Randomized Algorithms. Cambridge, UK: Cambridge University Press, 1995.
______. “Randomized Algorithms.” ACM Computing Surveys (CSUR) 28, no. 1 (1996): 33–37.
Mucci, A. G. “On a Class of Secretary Problems.” Annals of Probability 1 (1973): 417–427.
Murray, David. Chapters in the History of Bookkeeping, Accountancy and Commercial Arithmetic. Glasgow, UK: Jackson, Wylie, 1930.
Myerson, Roger B. “Nash Equilibrium and the History of Economic Theory.” Journal of Economic Literature 1999, 1067–1082.
______. “Optimal Auction Design.” Mathematics of Operations Research 6, no. 1 (1981): 58–73.
Nash, John F. “Equilibrium Points in N-Person Games.” Proceedings of the National Academy of Sciences 36, no. 1 (1950): 48–49.
______. “Non-Cooperative Games.” Annals of Mathematics 54, no. 2 (1951): 286–295.
______. “The Bargaining Problem.” Econometrica 18, no. 2 (1950): 155–162.
Navarro, Daniel J., and Ben R. Newell. “Information Versus Reward in a Changing World.” In Proceedings of the 36th Annual Conference of the Cognitive Science Society, 2014, 1054–1059.
Neumann, John von, and Oskar Morgenstern. Theory of Games and Economic Behavior. Princeton, NJ: Princeton University Press, 1944.
Neyman, Jerzy. “Outline of a Theory of Statistical Estimation Based on the Classical Theory of Probability.” Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences 236, no. 767 (1937): 333–380.
Nichols, Kathleen, and Van Jacobson. “Controlling Queue Delay: A Modern AQM Is Just One Piece of the Solution to Bufferbloat.” ACM Queue Networks 10, no. 5 (2012): 20–34.
Nisan, Noam, and Amir Ronen. “Algorithmic Mechanism Design.” In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, 1999, 129–140.
Olshausen, Bruno A., and David J. Field. “Emergence of Simple-Cell Receptive Field Properties by Learning a Sparse Code for Natural Images.” Nature 381 (1996): 607–609.
O’Neil, Elizabeth J., Patrick E. O’Neil, and Gerhard Weikum. “The LRU-K Page Replacement Algorithm for Database Disk Buffering,” ACM SIGMOD Record 22, no. 2 (1993): 297–306.
Papadimitriou, Christos. “Foreword.” In Algorithmic Game Theory. Edited by Noam Nisan, Tim Roughgarden, Éva Tardos, and Vijay V. Vazirani. Cambridge, UK: Cambridge University Press, 2007.
Papadimitriou, Christos H., and John N. Tsitsiklis. “The Complexity of Optimal Queuing Network Control.” Mathematics of Operations Research 24 (1999): 293–305.
Papadimitriou, Christos H., and Mihalis Yannakakis. “On Complexity as Bounded Rationality.” In Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994, 726–733.
Pardalos, Panos M., and Georg Schnitger. “Checking Local Optimality in Constrained Quadratic Programming is NP-hard.” Operations Research Letters 7 (1988): 33–35.
Pareto, Vilfredo. Cours d’économie politique. Lausanne: F. Rouge, 1896.
Parfit, Derek. Reasons and Persons. Oxford, UK: Oxford University Press, 1984.
Partnoy, Frank. Wait: The Art and Science of Delay. New York: PublicAffairs, 2012.
Pascal, Blaise. Pensées sur la religion et sur quelques autres sujets. Paris: Guillaume Desprez, 1670.
Peter, Laurence J., and Raymond Hull. The Peter Principle: Why Things Always Go Wrong. New York: Morrow, 1969.
Petruccelli, Joseph D. “Best-Choice Problems Involving Uncertainty of Selection and Recall of Observations.” Journal of Applied Probability 18 (1981): 415–425.
Pettie, Seth, and Vijaya Ramachandran. “An Optimal Minimum Spanning Tree Algorithm.” Journal of the ACM 49, no. 1 (2002): 16–34.
Pinedo, Michael. Sch
eduling: Theory, Algorithms, and Systems. New York: Springer, 2012.
______. “Stochastic Scheduling with Release Dates and Due Dates.” Operations Research 31, no. 3 (1983): 559–572.
Pirsig, Robert M. Zen and the Art of Motorcycle Maintenance. New York: Morrow, 1974.
Poundstone, William. Fortune’s Formula: The Untold Story of the Scientific Betting System That Beat the Casinos and Wall Street. New York: Macmillan, 2005.
______. Prisoner’s Dilemma: John von Neumann, Game Theory, and the Puzzle of the Bomb. New York: Doubleday, 1992.
Prabhakar, Balaji, Katherine N. Dektar, and Deborah M. Gordon. “The Regulation of Ant Colony Foraging Activity Without Spatial Information.” PLoS Computational Biology 8, no. 8 (2012): e1002670.
Presman, Ernst L’vovich, and Isaac Mikhailovich Sonin. “The Best Choice Problem for a Random Number of Objects.” Teoriya Veroyatnostei i ee Primeneniya 17 (1972): 695–706.
Production and Operations Management Society. “James R. Jackson.” Production and Operations Management 17, no. 6 (2008): i–ii.
Rabin, Michael O. “Probabilistic Algorithm for Testing Primality.” Journal of Number Theory 12, no. 1 (1980): 128–138.
Rabin, Michael O., and Dana Scott. “Finite Automata and Their Decision Problems.” IBM Journal of Research and Development 3 (1959): 114–125.
Raichle, Marcus E., and Debra A. Gusnard. “Appraising the Brain’s Energy Budget.” Proceedings of the National Academy of Sciences 99, no. 16 (2002): 10237–10239.
Ramakrishnan, Kadangode, and Sally Floyd. A Proposal to Add Explicit Congestion Notification (ECN) to IP. Technical report. RFC 2481, January 1999.
Ramakrishnan, Kadangode, Sally Floyd, and David Black. The Addition of Explicit Congestion Notification (ECN) to IP. Technical report. RFC 3168, September 2001.
Ramscar, Michael, Peter Hendrix, Cyrus Shaoul, Petar Milin, and Harald Baayen. “The Myth of Cognitive Decline: Non-Linear Dynamics of Lifelong Learning.” Topics in Cognitive Science 6, no. 1 (2014): 5–42.
Rasmussen, Willis T., and Stanley R. Pliska. “Choosing the Maximum from a Sequence with a Discount Function.” Applied Mathematics and Optimization 2 (1975): 279–289.
Rawls, John. A Theory of Justice. Cambridge, MA: Harvard University Press, 1971.
Revusky, Samuel H., and Erwin W. Bedarf. “Association of Illness with Prior Ingestion of Novel Foods.” Science 155, no. 3759 (1967): 219–220.
Reynolds, Andy M. “Signatures of Active and Passive Optimized Lévy Searching in Jellyfish.” Journal of the Royal Society Interface 11, no. 99 (2014): 20140665.
Ridgway, Valentine F. “Dysfunctional Consequences of Performance Measurements.” Administrative Science Quarterly 1, no. 2 (1956): 240–247.
Riley, John G., and William F. Samuelson. “Optimal Auctions.” American Economic Review 71, no. 3 (1981): 381–392.
Rittaud, Benoît, and Albrecht Heeffer. “The Pigeonhole Principle, Two Centuries Before Dirichlet.” Mathematical Intelligencer 36, no. 2 (2014): 27–29.
Rivest, Ronald L., Adi Shamir, and Leonard Adleman. “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems.” Communications of the ACM 21, no. 2 (1978): 120–126.
Robbins, Herbert. “Some Aspects of the Sequential Design of Experiments.” Bulletin of the American Mathematical Society 58 (1952): 527–535.
Robinson, Julia. On the Hamiltonian Game (a Traveling Salesman Problem). Technical report RAND/RM-303. Santa Monica, CA: RAND, 1949.
Rogerson, Richard, Robert Shimer, and Randall Wright. Search-Theoretic Models of the Labor Market: A Survey. Technical report. Cambridge, MA: National Bureau of Economic Research, 2004.
Rose, John S. “A Problem of Optimal Choice and Assignment.” Operations Research 30 (1982): 172–181.
Rosenbaum, David A., Lanyun Gong, and Cory Adam Potts. “Pre-Crastination: Hastening Subgoal Completion at the Expense of Extra Physical Effort.” Psychological Science 25, no. 7 (2014): 1487–1496.
Rosenbluth, Marshall. Marshall Rosenbluth, interviewed by Kai-Henrik Barth. August 11, 2003, College Park, MD.
Rostker, Bernard D., Harry J. Thie, James L. Lacy, Jennifer H. Kawata, and Susanna W. Purnell. The Defense Officer Personnel Management Act of 1980: A Retrospective Assessment. Santa Monica, CA: RAND, 1993.
Roughgarden, Tim, and Éva Tardos. “How Bad Is Selfish Routing?” Journal of the ACM 49, no. 2 (2002): 236–259.
Russell, Bertrand. “The Elements of Ethics.” In Philosophical Essays, 13–59. London: Longmans, Green, 1910.
Russell, Stuart, and Peter Norvig. Artificial Intelligence: A Modern Approach, 3rd ed. Upper Saddle River, NJ: Pearson, 2009.
Russell, Stuart, and Eric Wefald. Do the Right Thing. Cambridge, MA: MIT Press, 1991.
Sagan, Carl. Broca’s Brain: Reflections on the Romance of Science. New York: Random House, 1979.
Sakaguchi, Minoru. “Bilateral Sequential Games Related to the No-Information Secretary Problem.” Mathematica Japonica 29 (1984): 961–974.
______. “Dynamic Programming of Some Sequential Sampling Design.” Journal of Mathematical Analysis and Applications 2 (1961): 446–466.
Sakaguchi, Minoru, and Mitsushi Tamaki. “On the Optimal Parking Problem in Which Spaces Appear Randomly.” Bulletin of Informatics and Cybernetics 20 (1982): 1–10.
Sartre, Jean-Paul. No Exit: A Play in One Act. New York: Samuel French, 1958.
Schelling, Thomas C. “Altruism, Meanness, and Other Potentially Strategic Behaviors.” American Economic Review 68, no. 2 (1978): 229–230.
______. The Strategy of Conflict. Cambridge, MA: Harvard University Press, 1960.
Schneier, Bruce. Applied Cryptography. New York: Wiley, 1994.
Schrage, Linus. “A Proof of the Optimality of the Shortest Remaining Processing Time Discipline.” Operations Research 16, no. 3 (1968): 687–690.
Schrijver, Alexander. “On the History of Combinatorial Optimization (Till 1960).” In Handbooks in Operations Research and Management Science: Discrete Optimization. Edited by Karen Aardal, George L. Nemhauser, and Robert Weismantel. Amsterdam: Elsevier, 2005, 1–68.
Schwartz, Jacob T. “Fast Probabilistic Algorithms for Verification of Polynomial Identities.” Journal of the ACM 27, no. 4 (1980): 701–717.
Seale, Darryl A., and Amnon Rapoport. “Sequential Decision Making with Relative Ranks: An Experimental Investigation of the ‘Secretary Problem.’” Organizational Behavior and Human Decision Processes 69 (1997): 221–236.
Sen, Amartya. “Goals, Commitment, and Identity.” Journal of Law, Economics, and Organization 1 (1985): 341–355.
Sethi, Rajiv. “Algorithmic Trading and Price Volatility.” Rajiv Sethi (blog), May 7, 2010, http://rajivsethi.blogspot.com/2010/05/algorithmic-trading-and-price.html.
Sevcik, Kenneth C. “Scheduling for Minimum Total Loss Using Service Time Distributions.” Journal of the ACM 21, no. 1 (1974): 66–75.
Shallit, Jeffrey. “What This Country Needs Is an 18¢ Piece.” Mathematical Intelligencer 25, no. 2 (2003): 20–23.
Shasha, Dennis, and Cathy Lazere. Out of Their Minds: The Lives and Discoveries of 15 Great Computer Scientists. New York: Springer, 1998.
Shasha, Dennis, and Michael Rabin. “An Interview with Michael Rabin.” Communications of the ACM 53, no. 2 (2010): 37–42.
Shaw, Frederick S. An Introduction to Relaxation Methods. New York: Dover, 1953.
Shaw, George Bernard. Man and Superman: A Comedy and a Philosophy. Cambridge, MA: Harvard University Press, 1903.
Shoup, Donald. The High Cost of Free Parking. Chicago: APA Planners Press, 2005.
Simon, Herbert A. “A Behavioral Model of Rational Choice.” Quarterly Journal of Economics 69, no. 1 (1955): 99–118.
______. Models of Man. New York: Wiley, 1957.
______. “On a Class of Skew Distribution Functions.” Biometrika, 1955, 425–440.
Siroker, Dan. “How Obama Raised $60 Million by Running a Simple Experiment.” The Optimizely Blog: A/B Testing You’ll Actuall
y Use (blog), November 29, 2010, https://blog.optimizely.com/2010/11/29/how-obama-raised-60-million-by-running-a-simple-experiment/.
Siroker, Dan, and Pete Koomen. A/B Testing: The Most Powerful Way to Turn Clicks into Customers. New York: Wiley, 2013.
Sleator, Daniel D., and Robert E. Tarjan. “Amortized Efficiency of List Update and Paging Rules.” Communications of the ACM 28 (1985): 202–208.
Smith, Adam. The Theory of Moral Sentiments. Printed for A. Millar, in the Strand; and A. Kincaid and J. Bell, in Edinburgh, 1759.
Smith, M. H. “A Secretary Problem with Uncertain Employment.” Journal of Applied Probability 12, no. 3 (1975): 620–624.
Smith, Wayne E. “Various Optimizers for Single-Stage Production.” Naval Research Logistics Quarterly 3, nos. 1–2 (1956): 59–66.
Solovay, Robert, and Volker Strassen. “A Fast Monte-Carlo Test for Primality.” SIAM Journal on Computing 6 (1977): 84–85.
Starr, Norman. “How to Win a War if You Must: Optimal Stopping Based on Success Runs.” Annals of Mathematical Statistics 43, no. 6 (1972): 1884–1893.
Stephens, David W., and John R. Krebs. Foraging Theory. Princeton, NJ: Princeton University Press, 1986.
Stewart, Martha. Martha Stewart’s Homekeeping Handbook: The Essential Guide to Caring for Everything in Your Home. New York: Clarkson Potter, 2006.
Steyvers, Mark, Michael D. Lee, and Eric-Jan Wagenmakers. “A Bayesian Analysis of Human Decision-Making on Bandit Problems.” Journal of Mathematical Psychology 53 (2009): 168–179.
Stigler, George J. “The Economics of Information.” Journal of Political Economy 69 (1961): 213–225.
______. “Information in the Labor Market.” Journal of Political Economy 70 (1962): 94–105.
Stigler, Stephen M. “Stigler’s Law of Eponymy.” Transactions of the New York Academy of Sciences 39 (1980): 147–157.
Tamaki, Mitsushi. “Adaptive Approach to Some Stopping Problems.” Journal of Applied Probability 22 (1985): 644–652.
______. “An Optimal Parking Problem.” Journal of Applied Probability 19 (1982): 803–814.
______. “Optimal Stopping in the Parking Problem with U-Turn.” Journal of Applied Probability 25 (1988): 363–374.
Algorithms to Live By Page 45