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 enforcable decisions, prices are posted without knowing the future events or even the current event, and are thus inherently dominant strategy incentive compatible. In particular we show that one can give efficient posted price mechanisms for metrical task systems, some instances of the k-server problem, and metrical matching problems. We give both deterministic and randomized algorithms. Such posted price mechanisms decrease the social cost dramatically over selfish behavior where no decision incurs a charge. One alluring application of this is reducing the social cost of free parking exponentially.

[1]  Mohammad Taghi Hajiaghayi,et al.  Adaptive limited-supply online auctions , 2004, EC '04.

[2]  Moni Naor,et al.  Privacy preserving auctions and mechanism design , 1999, EC '99.

[3]  D. Shoup.  The High Cost of Free Parking , 1997 .

[4]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[5]  Noam Nisan,et al.  Competitive analysis of incentive compatible on-line auctions , 2000, EC '00.

[6]  Marek Chrobak,et al.  An Optimal On-Line Algorithm for k-Servers on Trees , 1991, SIAM J. Comput..

[7]  Allan Borodin,et al.  An optimal on-line algorithm for metrical task system , 1992, JACM.

[8]  Christos H. Papadimitriou,et al.  Worst-case Equilibria , 1999, STACS.

[9]  Samir Khuller,et al.  On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..

[10]  Lyle A. McGeoch,et al.  Competitive Algorithms for Server Problems , 1990, J. Algorithms.

[11]  Christos H. Papadimitriou,et al.  On the k-server conjecture , 1995, JACM.

[12]  Anupam Gupta,et al.  The Online Metric Matching Problem for Doubling Metrics , 2012, ICALP.

[13]  Sandy Irani,et al.  A Competitive 2-Server Algorithm , 1991, Inf. Process. Lett..

[14]  Bala Kalyanasundaram,et al.  On-line Network Optimization Problems , 1996, Online Algorithms.

[15]  Marek Chrobak,et al.  New results on server problems , 1991, SODA '90.

[16]  Eric J. Friedman,et al.  Pricing WiFi at Starbucks: issues in online mechanism design , 2003, EC '03.

[17]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[18]  Yossi Azar,et al.  Reducing truth-telling online mechanisms to online optimization , 2003, STOC '03.

[19]  Nicole Immorlica,et al.  Online auctions and generalized secretary problems , 2008, SECO.

[20]  Elias Koutsoupias,et al.  The k-server problem , 2009, Comput. Sci. Rev..