Where should you park your car? The $\frac{1}{2}$ rule

DOI10.1088/1742-5468/ab96b7zbMath1459.76014arXiv2003.10603OpenAlexW3100268059MaRDI QIDQ5854149

P. L. Krapivskij, S. Redner

Publication date: 16 March 2021

Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.10603

zbMATH Keywords

stochastic processestransport propertiestraffic and crowd dynamics

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Traffic and pedestrian flow models (76A30)

Cites Work

• Parking functions for mappings
• Partially ordered secretaries
• On the analysis of linear probing hashing
• A note on bounds for the odds theorem of optimal stopping.
• Who solved the secretary problem? With comments and a rejoinder by the author
• Sum the odds to one and stop
• The best-choice problem for partially ordered objects.
• Intelligent parking systems
• Optimal selection based on relative rank (the 'Secretary Problem')
• Asymptotic distribution for the cost of linear probing hashing
• The secretary problem on an unknown poset
• Individual displacements for linear probing hashing with different insertion policies
• On a universal best choice algorithm for partially ordered sets
• New developments of the odds theorem
• An Occupancy Discipline and Applications
• Dynamic Programming and Decision Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Where should you park your car? The $\frac{1}{2}$ rule