Competitively Pricing Parking in a Tree
Max Bender, Jacob Gilbert, Aditya Krishnan, Kirk Pruhs
TL;DR
This paper introduces a poly-logarithmic competitive posted-price algorithm for online metrical searching in tree metrics, addressing demand-responsive parking pricing challenges.
Contribution
It presents the first poly-log competitive posted-price algorithm for online metrical searching in tree metrics, advancing demand-responsive parking pricing methods.
Findings
Achieved poly-log competitive ratio for online metrical searching.
Developed posted-price algorithms for demand-responsive parking systems.
Extended online metrical matching and searching frameworks.
Abstract
Motivated by demand-responsive parking pricing systems we consider posted-price algorithms for the online metrical matching problem and the online metrical searching problem in a tree metric. Our main result is a poly-log competitive posted-price algorithm for online metrical searching.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.