HackerPapers

arXiv:1904.06612physics.soc-ph

Simple Parking Strategies

P. L. Krapivsky, S. Redner

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

Abstract

We investigate simple strategies that embody the decisions that one faces when trying to park near a popular destination. Should one park far from the target (destination), where finding a spot is easy, but then be faced with a long walk, or should one attempt to look for a desirable spot close to the target, where spots may be hard to find? We study an idealized parking process on a one-dimensional geometry where the desired target is located at $x=0$, cars enter the system from the right at a rate $λ$ and each car leaves at a unit rate. We analyze three parking strategies---meek, prudent, and optimistic---and determine which is optimal.

arXiv comments
16 pages, 10 figures, IOP format. Revised version has various small corrections and nearly coincides with the published version
Journal reference
J. Stat. Mech. 093404 (2019)
DOI
doi:10.1088/1742-5468/ab3a2a
Subjects
physics.soc-phPhysics and Society cond-mat.stat-mechStatistical Mechanics

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Sep 2019 to Sep 2019. Found in 2 HN submissions from Jan 2022 to Jul 2025. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.