Wait/walk dilemma

The wait/walk dilemma occurs when waiting for a bus at a bus stop, when the duration of the wait may exceed the time needed to arrive at a destination by another means, especially walking. Some work on this problem was featured in the 2008 "Year in Ideas" issue of The New York Times Magazine.^[1]

YouTube Encyclopedic

1/2
Views:
3 851
9 865

Transcription

Research

The dilemma has been studied in an unpublished report entitled "Walk Versus Wait: The Lazy Mathematician Wins."^[2]^[3] Anthony B. Morton's paper "A Note on Walking Versus Waiting" supports and extends Chen et al.'s results.^[4] Ramnik Arora's "A Note on Walk versus Wait: Lazy Mathematician Wins" discusses what he believes to be some of the errors in Chen et al.'s argument; the result of Chen et al.'s paper still holds following Arora's alleged corrections.^[5] As early as 1990, writer Tom Parker had observed that "walking is faster than waiting for a bus if you're going less than a mile".^[6]

As an undergraduate mathematics major at Harvard, Scott D. Kominers first began fixating on the problem while walking from MIT to Harvard,^[2] which are more than a mile apart in Cambridge, Massachusetts along MBTA bus route 1. He enlisted the help of Caltech physics major Justin G. Chen and Harvard statistics major Robert W. Sinnott to perform the analysis.^[2]

Their paper concludes that it is usually mathematically quicker to wait for the bus^{[dubious – discuss]}, at least for a little while. But once made, the decision to walk should be final instead of waiting again at subsequent stops.^[2]^[1] The paper also showed potential applications to the field of cryptography.

Interstellar travel

The corresponding problem in interstellar travel is called the wait calculation, which tries to determine the optimal time to wait for technological progress to improve spaceship speeds before committing to the journey.

References

^ ^a ^b Thompson, Clive (2008-12-13). "The Bus-Wait Formula". The New York Times Magazine: Year in Ideas.^{[dead link]}
^ ^a ^b ^c ^d Bierman, Noah (2008-02-03). "Cellphones remain mum in tunnels". The Boston Globe.
^ "Lazy option is best when waiting for the bus". New Scientist Magazine. 2008-01-23.
^ Morton (2008-02-25). "A Note on Walking Versus Waiting". arXiv:0802.3653 [math.HO].
^ Ramnik Arora (2008-03-21). "A Note on Walk versus Wait: Lazy Mathematician Wins". arXiv:0803.3106 [math.HO].
^ Excerpts from the book "Never Trust a Calm Dog and Other Rules of Thumb", as reproduced in the Gatesway Messenger. May 22, 1996. Retrieved 9 November 2018

External links

v t e Topics in game theory
Definitions	Congestion game Cooperative game Determinacy Escalation of commitment Extensive-form game First-player and second-player win Game complexity Graphical game Hierarchy of beliefs Information set Normal-form game Preference Sequential game Simultaneous game Simultaneous action selection Solved game Succinct game
Equilibrium concepts	Bayes correlated equilibrium Bayesian Nash equilibrium Berge equilibrium Core Correlated equilibrium Epsilon-equilibrium Evolutionarily stable strategy Gibbs equilibrium Mertens-stable equilibrium Markov perfect equilibrium Nash equilibrium Pareto efficiency Perfect Bayesian equilibrium Proper equilibrium Quantal response equilibrium Quasi-perfect equilibrium Risk dominance Satisfaction equilibrium Self-confirming equilibrium Sequential equilibrium Shapley value Strong Nash equilibrium Subgame perfection Trembling hand
Strategies	Backward induction Bid shading Collusion Forward induction Grim trigger Markov strategy Dominant strategies Pure strategy Mixed strategy Strategy-stealing argument Tit for tat
Classes of games	Bargaining problem Cheap talk Global game Intransitive game Mean-field game Mechanism design n-player game Perfect information Large Poisson game Potential game Repeated game Screening game Signaling game Stackelberg competition Strictly determined game Stochastic game Symmetric game Zero-sum game
Games	Go Chess Infinite chess Checkers Tic-tac-toe Prisoner's dilemma Gift-exchange game Optional prisoner's dilemma Traveler's dilemma Coordination game Chicken Centipede game Lewis signaling game Volunteer's dilemma Dollar auction Battle of the sexes Stag hunt Matching pennies Ultimatum game Rock paper scissors Pirate game Dictator game Public goods game Blotto game War of attrition El Farol Bar problem Fair division Fair cake-cutting Cournot game Deadlock Diner's dilemma Guess 2/3 of the average Kuhn poker Nash bargaining game Induction puzzles Trust game Princess and monster game Rendezvous problem
Theorems	Arrow's impossibility theorem Aumann's agreement theorem Folk theorem Minimax theorem Nash's theorem Negamax theorem Purification theorem Revelation principle Sprague–Grundy theorem Zermelo's theorem
Key figures	Albert W. Tucker Amos Tversky Antoine Augustin Cournot Ariel Rubinstein Claude Shannon Daniel Kahneman David K. Levine David M. Kreps Donald B. Gillies Drew Fudenberg Eric Maskin Harold W. Kuhn Herbert Simon Hervé Moulin John Conway Jean Tirole Jean-François Mertens Jennifer Tour Chayes John Harsanyi John Maynard Smith John Nash John von Neumann Kenneth Arrow Kenneth Binmore Leonid Hurwicz Lloyd Shapley Melvin Dresher Merrill M. Flood Olga Bondareva Oskar Morgenstern Paul Milgrom Peyton Young Reinhard Selten Robert Axelrod Robert Aumann Robert B. Wilson Roger Myerson Samuel Bowles Suzanne Scotchmer Thomas Schelling William Vickrey
Miscellaneous	All-pay auction Alpha–beta pruning Bertrand paradox Bounded rationality Combinatorial game theory Confrontation analysis Coopetition Evolutionary game theory First-move advantage in chess Glossary of game theory List of game theorists List of games in game theory No-win situation Solving chess Topological game Tragedy of the commons Tyranny of small decisions

This page was last edited on 29 November 2023, at 17:42

From Wikipedia, the free encyclopedia