Motivated by demand-responsive parking pricing systems, we consider posted-price algorithms for the online metric matching problem. We give an O(logn)-competitive posted-price randomized algorithm in the case that the metric space is a line. In particular, in this setting we show how to implement the ubiquitous guess-and-double technique using prices.
@article{arxiv.2310.12394,
title = {An $O(\log n)$-Competitive Posted-Price Algorithm for Online Matching on the Line},
author = {Stephen Arndt and Josh Ascher and Kirk Pruhs},
journal= {arXiv preprint arXiv:2310.12394},
year = {2023}
}