Competitively Pricing Parking in a Tree

Pricing Online Decisions: Beyond Auctions

We consider dynamic pricing schemes in online settings where selfish agents generate online events. Previous work on online mechanisms has dealt almost entirely with the goal of maximizing social welfare or revenue in an auction settings. This paper deals with quite general settings and minimizing social costs. We show that appropriately computed posted prices allow one to achieve essentially the same performance as the best online algorithm. This holds in a wide variety of settings. Unlike online algorithms that learn about the event, and then make enforceable decisions, prices are posted wit…

直线上在线匹配的 $O(\log n)$ 竞争比标价算法

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

针对需求响应式停车定价系统，本文研究了直线上在线度量匹配问题，提出了一种 $O(\log n)$ 竞争比的标价随机算法，并展示了如何利用价格机制实现 guess-and-double 技术。