Algorithms to Live By

Home > Nonfiction > Algorithms to Live By > Page 43
Algorithms to Live By Page 43

by Brian Christian


  Baltzly, Dirk. “Stoicism.” In The Stanford Encyclopedia of Philosophy (spring 2014 edition). Edited by Edward N. Zalta. http://plato.stanford.edu/archives/spr2014/entries/stoicism/.

  Banks, Jeffrey S., and Rangarajan K Sundaram. “Switching Costs and the Gittins Index.” Econometrica 62 (1994): 687–694.

  Barabási, Albert-László. Linked: How Everything Is Connected to Everything Else and What It Means for Business, Science, and Everyday Life. New York: Penguin, 2002.

  Baran, Paul. “On Distributed Communications.” Volumes I–XI, RAND Corporation Research Documents, August 1964, 637–648.

  Barnard, Chester I. The Functions of the Executive. Cambridge, MA: Harvard University Press, 1938.

  Bartlett, Robert H., Dietrich W. Roloff, Richard G. Cornell, Alice French Andrews, Peter W. Dillon, and Joseph B. Zwischenberger. “Extracorporeal Circulation in Neonatal Respiratory Failure: A Prospective Randomized Study.” Pediatrics 76, no. 4 (1985): 479–487.

  Baumgardt, Carola. Johannes Kepler: Life and Letters. New York: Philosophical Library, 1951.

  Bavelas, Janet B., Linda Coates, and Trudy Johnson. “Listeners as Co-Narrators.” Journal of Personality and Social Psychology 79, no. 6 (2000): 941–952.

  Bayes, Thomas. “An Essay Towards Solving a Problem in the Doctrine of Chances.” Philosophical Transactions 53 (1763): 370–418.

  Bearden, Neil. “A New Secretary Problem with Rank-Based Selection and Cardinal Payoffs.” Journal of Mathematical Psychology 50 (2006): 58–59.

  Bélády, Laszlo A. “A Study of Replacement Algorithms for a Virtual-Storage Computer.” IBM Systems Journal 5 (1966): 78–101.

  Bélády, Laszlo A., Robert A Nelson, and Gerald S. Shedler. “An Anomaly in Space-Time Characteristics of Certain Programs Running in a Paging Machine.” Communications of the ACM 12, no. 6 (1969): 349–353.

  Belew, Richard K. Finding Out About: A Cognitive Perspective on Search Engine Technology and the WWW. Cambridge, UK: Cambridge University Press, 2000.

  Bell, Aubrey F. G. In Portugal. New York: John Lane, 1912.

  Bellhouse, David R. “The Reverend Thomas Bayes, FRS: A Biography to Celebrate the Tercentenary of His Birth.” Statistical Science 19 (2004): 3–43.

  Bellman, Richard. Dynamic Programming. Princeton, NJ: Princeton University Press, 1957.

  ______. “A Problem in the Sequential Design of Experiments.” Sankhyā: The Indian Journal of Statistics 16 (1956): 221–229.

  Bellows, Meghan L., and J. D. Luc Peterson. “Finding an Optimal Seating Chart.” Annals of Improbable Research (2012).

  Benenson, Itzhak, Karel Martens, and Slava Birfir. “PARKAGENT: An Agent-Based Model of Parking in the City.” Computers, Environment and Urban Systems 32, no. 6 (2008): 431–439.

  Berezovsky, Boris, and Alexander V. Gnedin. Problems of Best Choice (in Russian). Moscow: Akademia Nauk, 1984.

  Berg-Kirkpatrick, Taylor, and Dan Klein. “Decipherment with a Million Random Restarts.” In Proceedings of the Conference on Empirical Methods in Natural Language Processing (2013): 874–878.

  Bernardo, Antonio E., and Ivo Welch. “On the Evolution of Overconfidence and Entrepreneurs.” Journal of Economics & Management Strategy 10, no. 3 (2001): 301–330.

  Berry, Donald A. “A Bernoulli Two-Armed Bandit.” Annals of Mathematical Statistics 43 (1972): 871–897.

  ______. “Comment: Ethics and ECMO.” Statistical Science 4 (1989): 306–310.

  Berry, Donald A., and Bert Fristed. Bandit Problems: Sequential Allocation of Experiments. New York: Chapman and Hall, 1985.

  Bettencourt, Luís M. A., José Lobo, Dirk Helbing, Christian Kühnert, and Geoffrey B. West. “Growth, Innovation, Scaling, and the Pace of Life in Cities.” Proceedings of the National Academy of Sciences 104, no. 17 (2007): 7301–7306.

  Bikhchandani, Sushil, David Hirshleifer, and Ivo Welch. “A Theory of Fads, Fashion, Custom, and Cultural Change as Informational Cascades.” Journal of Political Economy 100, no. 5 (1992): 992–1026.

  ______. “Learning from the Behavior of Others: Conformity, Fads, and Informational Cascades.” Journal of Economic Perspectives 12, no. 3 (1998): 151–170.

  Binmore, Ken. Game Theory: A Very Short Introduction. New York: Oxford University Press, 2007.

  ______. Natural Justice. New York: Oxford University Press, 2005.

  Bjarnason, Ronald, Alan Fern, and Prasad Tadepalli. “Lower Bounding Klondike Solitaire with Monte-Carlo Planning.” In Proceedings of the 19th International Conference on Automated Planning and Scheduling, ICAPS 2009.

  Blau, Peter Michael. The Dynamics of Bureaucracy: A Study of Interpersonal Relations in Two Government Agencies. Chicago: University of Chicago Press, 1955.

  Bloom, Burton H. “Space/Time Trade-offs in Hash Coding with Allowable Errors.” Communications of the ACM 13, no. 7 (1970): 422–426.

  Boguslavsky, Leonid, Karim Harzallah, A. Kreinen, K. Sevcik, and Alexander Vainshtein. “Optimal Strategies for Spinning and Blocking.” Journal of Parallel and Distributed Computing 21, no. 2 (1994): 246–254.

  Boorstin, Daniel J. The Discoverers: A History of Man’s Search to Know His World and Himself. New York: Random House, 1983.

  Bradt, Russell N., S. M. Johnson, and Samuel Karlin. “On Sequential Designs for Maximizing the Sum of N Observations.” Annals of Mathematical Statistics 27 (1956): 1060–1074.

  Branch, John. “Snow Fall: The Avalanche at Tunnel Creek.” New York Times, December 20, 2012.

  Brown, Alexander L., and Joanna N. Lahey. Small Victories: Creating Intrinsic Motivation in Savings and Debt Reduction. Technical report. Cambridge, MA: National Bureau of Economic Research, 2014.

  Brush, Eleanor R., David C. Krakauer, and Jessica C. Flack. “A Family of Algorithms for Computing Consensus About Node State from Network Data.” PLoS Computational Biology 9, no. 7 (2013).

  Bruss, F. Thomas. “A Unified Approach to a Class of Best Choice Problems with an Unknown Number of Options.” Annals of Probability 12 (1984): 882–889.

  Buch, P. “Future Prospects Discussed.” Nature 368 (1994): 107–108.

  Buffon, Georges-Louis Leclerc, Comte de. “Essai d’arithmétique morale.” Supplément à l’Histoire naturelle, générale et particuliére 4 (1777): 46–148.

  Burks, Arthur W., Herman H. Goldstine, and John von Neumann. Preliminary Discussion of the Logical Design of an Electronic Computing Instrument. Princeton, NJ: Institute for Advanced Study, 1946.

  Burrell, Quentin. “A Simple Stochastic Model for Library Loans.” Journal of Documentation 36, no. 2 (1980): 115–132.

  Burthe Jr., Ronald. “Further Investigations with the Strong Probable Prime Test.” Mathematics of Computation of the American Mathematical Society 65, no. 213 (1996): 373–381.

  Cabell, James Branch. The Silver Stallion. New York: Robert M. McBride, 1926.

  Campbell, Donald T. “Blind Variation and Selective Retention in Creative Thought as in Other Knowledge Processes.” Psychological Review 67 (1960): 380–400.

  Carpenter, Brian, and Robert Hinden. Adaptation of RFC 1149 for IPv6. Technical report. RFC 6214, April 2011.

  Carroll, Lewis. Sylvie and Bruno Concluded. London: Macmillan, 1893.

  Carstensen, Laura L. “Social and Emotional Patterns in Adulthood: Support for Socioemotional Selectivity Theory.” Psychology and Aging 7 (1992): 331–338.

  Cassady, C. Richard, and John E. Kobza. “A Probabilistic Approach to Evaluate Strategies for Selecting a Parking Space.” Transportation Science 32, no. 1 (1998): 30–42.

  Cawdrey, Robert. A Table Alphabeticall, conteyning and teaching the true writing, and vnderstanding of hard vsuall English wordes, borrowed from the Hebrew, Greeke, Latine, or French, &c. With the interpretation thereof by plaine English words, gathered for the benefit & helpe of ladies, gentlewomen, or any other vnskilfull persons. Whereby they may the more easilie and better vnderstand many hard English wordes, which they shall heare or read in Scriptures, Sermons, or elswhere, and also be made able to vse the same aptly themselues. L
ondon: Edmund Weaver, 1604.

  Cayley, Arthur. “Mathematical Questions with Their Solutions.” Educational Times 23 (1875): 18–19.

  ______. The Collected Mathematical Papers of Arthur Cayley 10: 587–588. Cambridge, UK: Cambridge University Press, 1896.

  Cerf, Vinton G., and Robert E. Kahn. “A Protocol for Packet Network Intercommunication.” IEEE Transactions on Communications 22, no. 5 (1974): 637–648.

  Chabert, Jean-Luc, Evelyne Barbin, and Christopher John Weeks. A History of Algorithms: From the Pebble to the Microchip. Berlin: Springer, 1999.

  Charles, Susan T., and Laura L. Carstensen. “Social and Emotional Aging.” Annual Review of Psychology 61 (2010): 383–409.

  Chen, Stanley F., and Joshua Goodman. “An Empirical Study of Smoothing Techniques for Language Modeling.” In Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 1996, 310–318.

  Chen, Xi, and Xiaotie Deng. “Settling the Complexity of Two-Player Nash Equilibrium.” In Foundations of Computer Science, 2006, 261–272.

  Chow, Y. S., and Herbert Robbins. “A Martingale System Theorem and Applications.” In Proceedings of the Fourth Berkeley Symposium on Mathematical Statistics and Probability. Berkeley: University of California Press, 1961.

  ______. “On Optimal Stopping Rules.” Probability Theory and Related Fields 2 (1963): 33–49.

  Chow, Y. S., Sigaiti Moriguti, Herbert Robbins, and S. M. Samuels. “Optimal Selection Based on Relative Rank (the ‘Secretary Problem’).” Israel Journal of Mathematics 2 (1964): 81–90.

  Christian, Brian. “The A/B Test: Inside the Technology That’s Changing the Rules of Business.” Wired Magazine 20, no. 5 (2012).

  Christofides, Nicos. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem. Technical report 388. Pittsburgh: Graduate School of Industrial Administration, Carnegie Mellon University, 1976.

  Churchill, Winston. Winston S. Churchill: His Complete Speeches, 1897–1963. Edited by Robert Rhodes James. London: Chelsea House, 1974.

  Cirillo, Francesco. The Pomodoro Technique. Raleigh, NC: Lulu, 2009.

  Clarke, Donald D., and Louis Sokoloff. “Circulation and Energy Metabolism of the Brain.” In Basic Neurochemistry: Molecular, Cellular and Medical Aspects, 6th ed., edited by George J. Siegel, Bernard W. Agranoff, R. Wayne Albers, Stephen K. Fisher, and Michael D. Uhler. Philadelphia: Lippincott-Raven, 1999, 637–669.

  Clauset, Aaron, Cosma Rohilla Shalizi, and Mark E. J. Newman. “Power-Law Distributions in Empirical Data.” SIAM Review 51, no. 4 (2009): 661–703.

  Cobham, Alan. “The Intrinsic Computational Difficulty of Functions.” In Proceedings of the 1964 Congress on Logic, Methodology and Philosophy of Science. Amsterdam: North Holland, 1964.

  Conan Doyle, Arthur. “A Study in Scarlet: The Reminiscences of John H. Watson.” In Beeton’s Christmas Annual, vol. 29. London: Ward, Lock, 1887.

  Connor, James A. Kepler’s Witch: An Astronomer’s Discovery of Cosmic Order Amid Religious War, Political Intrigue, and the Heresy Trial of His Mother. New York: HarperCollins, 2004.

  Conti, Carl J., Donald H. Gibson, and Stanley H. Pitkowsky. “Structural Aspects of the System/360 Model 85, I: General Organization.” IBM Systems Journal 7 (1968): 2–14.

  Cook, Stephen A. “The Complexity of Theorem-Proving Procedures.” In Proceedings of the Third Annual ACM Symposium on Theory of Computing, 1971, 151–158.

  Cook, William. In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton, NJ: Princeton University Press, 2012.

  Covey, Stephen R. How to Succeed with People. Salt Lake City: Shadow Mountain, 1971.

  Craig, J. V. Aggressive Behavior of Chickens: Some Effects of Social and Physical Environments. Presented at the 27th Annual National Breeder’s Roundtable, May 11, Kansas City, MO, 1978.

  Dale, Andrew I. A History of Inverse Probability: From Thomas Bayes to Karl Pearson. New York: Springer, 1999.

  Daly, Lloyd W. Contributions to a History of Alphabetization in Antiquity and the Middle Ages. Brussels: Latomus, 1967.

  Damgård, Ivan, Peter Landrock, and Carl Pomerance. “Average Case Error Estimates for the Strong Probable Prime Test.” Mathematics of Computation 61, no. 203 (1993): 177–194.

  Daniels, Bryan C., David C. Krakauer, and Jessica C. Flack. “Sparse Code of Conflict in a Primate Society.” Proceedings of the National Academy of Sciences 109, no. 35 (2012): 14259–14264.

  Darwin, Charles. The Correspondence of Charles Darwin, Volume 2: 1837–1843. Edited by Frederick Burkhardt and Sydney Smith. Cambridge, UK: Cambridge University Press, 1987.

  Daskalakis, Constantinos, Paul W. Goldberg, and Christos H. Papadimitriou. “The Complexity of Computing a Nash Equilibrium.” ACM Symposium on Theory of Computing, 2006, 71–78.

  ______. “The Complexity of Computing a Nash Equilibrium.” SIAM Journal on Computing 39, no. 1 (2009): 195–259.

  Davis, Lydia. Almost No Memory: Stories. New York: Farrar, Straus & Giroux, 1997.

  Dawkins, Richard. The Evidence for Evolution, the Greatest Show on Earth. New York: Free Press, 2009.

  DeDeo, Simon, David C. Krakauer, and Jessica C. Flack. “Evidence of Strategic Periodicities in Collective Conflict Dynamics.” Journal of The Royal Society Interface, 2011.

  DeGroot, Morris H. Optimal Statistical Decisions. New York: McGraw-Hill, 1970.

  Demaine, Erik D., Susan Hohenberger, and David Liben-Nowell. “Tetris Is Hard, Even to Approximate.” In Computing and Combinatorics, 351–363. New York: Springer, 2003.

  DeMillo, Richard A., and Richard J. Lipton. “A Probabilistic Remark on Algebraic Program Testing.” Information Processing Letters 7, no. 4 (1978): 193–195.

  Denning, Peter J. “Thrashing: Its Causes and Prevention.” In Proceedings of the December 9–11, 1968, Fall Joint Computer Conference, Part I, 1968, 915–922.

  Diffie, Whitfield, and Martin E. Hellman. “New Directions in Cryptography.” Information Theory, IEEE Transactions on 22, no. 6 (1976): 644–654.

  Dillard, Annie. Pilgrim at Tinker Creek. New York: Harper’s Magazine Press, 1974.

  ______. The Writing Life. New York: Harper & Row, 1989.

  Dodgson, Charles Lutwidge. “Lawn Tennis Tournaments: The True Method of Assigning Prizes with a Proof of the Fallacy of the Present Method.” St. James’s Gazette, August 1, 1883: 5–6.

  Durant, Will. The Story of Philosophy: The Lives and Opinions of the Greater Philosophers. New York: Simon & Schuster, 1924.

  Edmonds, Jack. “Optimum Branchings.” Journal of Research of the National Bureau of Standards 71B, no. 4 (1967): 233–240.

  ______. “Paths, Trees, and Flowers.” Canadian Journal of Mathematics 17, no. 3 (1965): 449–467.

  Erlang, Agner Krarup. “Solution of Some Problems in the Theory of Probabilities of Significance in Automatic Telephone Exchanges.” Elektrotkeknikeren 13 (1917): 5–13.

  ______. “The Theory of Probabilities and Telephone Conversations.” Nyt Tidsskrift for Matematik B 20, nos. 33–39 (1909): 16.

  Everett III, Hugh. “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources.” Operations Research 11, no. 3 (1963): 399–417.

  Feldman, Dorian. “Contributions to the ‘Two-Armed Bandit’ Problem.” Annals of Mathematical Statistics 33 (1962): 847–856.

  Ferguson, Thomas S. Optimal Stopping and Applications. Available at http://www.math.ucla.edu/~tom/Stopping/.

  ______. “Stopping a Sum During a Success Run.” Annals of Statistics 4 (1976): 252–264.

  ______. “Who Solved the Secretary Problem?” Statistical Science 4 (1989): 282–289.

  Ferguson, Thomas S., Janis P. Hardwick, and Mitsushi Tamaki. “Maximizing the Duration of Owning a Relatively Best Object.” In Strategies for Sequential Search and Selection in Real Time, 37–57. Providence: American Mathematical Society, 1992.

  Ferriss, Timothy. The 4-Hour Workweek. New York: Crown, 2007.

  Fiore, Neil A. Th
e Now Habit: A Strategic Program for Overcoming Procrastination and Enjoying Guilt-Free Play. New York: Penguin, 2007.

  Fisher, Marshall L. “The Lagrangian Relaxation Method for Solving Integer Programming Problems.” Management Science 27, no. 1 (1981): 1–18.

  Fitzgerald, F. Scott. “The Crack-Up.” Esquire 5, nos. 2–4 (1936).

  ______. The Crack-Up with Other Uncollected Pieces. New York: New Directions, 1956.

  Flood, Merrill M. “Soft News.” Datamation 30, no. 20 (1984): 15–16.

  ______. “Some Experimental Games.” In Research Memorandum RM-789. Santa Monica, CA: RAND, 1952.

  ______. “The Traveling-Salesman Problem.” Operations Research 4, no. 1 (1956): 61–75.

  ______. “What Future Is There for Intelligent Machines?” Audio Visual Communication Review 11, no. 6 (1963): 260–270.

  Forster, Edward M. Howards End. London: Edward Arnold, 1910.

  Fortnow, Lance. The Golden Ticket: P, NP, and the Search for the Impossible. Princeton, NJ: Princeton University Press, 2013.

  Fraker, Guy C. “The Real Lincoln Highway: The Forgotten Lincoln Circuit Markers.” Journal of the Abraham Lincoln Association 25 (2004): 76–97.

  Frank, Robert H. “If Homo Economicus Could Choose His Own Utility Function, Would He Want One with a Conscience?” American Economic Review 1987, 593–604.

  ______. Passions within Reason: The Strategic Role of the Emotions. New York: Norton, 1988.

  Fredrickson, Barbara L., and Laura L. Carstensen. “Choosing Social Partners: How Old Age and Anticipated Endings Make People More Selective.” Psychology and Aging 5 (1990): 335–347.

  Freeman, P. R. “The Secretary Problem and Its Extensions: A Review.” International Statistical Review 51 (1983): 189–206.

  Fung, Helene H., Laura L. Carstensen, and Amy M. Lutz. “Influence of Time on Social Preferences: Implications for Life-Span Development.” Psychology and Aging 14 (1999): 595–604.

  Gal, David, and Blakeley B. McShane. “Can Small Victories Help Win the War? Evidence from Consumer Debt Management.” Journal of Marketing Research 49 (2012): 487–501.

 

‹ Prev