An \(O(\log n)\)-Competitive Posted-Price Algorithm for Online Matching on the Line

An \(O(\log n)\)-Competitive Posted-Price Algorithm for Online Matching on the Line

Motivated by demand-responsive parking pricing systems, we consider posted-price algorithms for the online metric matching problem. We give an \(O(\log n)\)-competitive posted-price randomized algorithm in the case that the metric space is a line. In particular, in this setting we show how to implem...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:arXiv.org 2023-10
Hauptverfasser: Arndt, Stephen, Ascher, Josh, Pruhs, Kirk
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Matching
Metric space
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Motivated by demand-responsive parking pricing systems, we consider posted-price algorithms for the online metric matching problem. We give an \(O(\log n)\)-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.
ISSN:2331-8422