Stackelberg network pricing games

Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008

Volumn , Issue , 2008, Pages 133-142

  Briest, Patrick ^a   Hoefer, Martin ^b   Krysta, Piotr ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Algorithmic pricing; Approximation algorithms; Inapproximability; Stackelberg games

Indexed keywords

APPROXIMATION ALGORITHMS; COST ACCOUNTING; ECONOMICS; POLYNOMIAL APPROXIMATION; POLYNOMIALS; PROBLEM SOLVING;

ALGORITHMIC PRICING; COMBINATORIAL MINIMIZATION; CONSTANT FACTOR APPROXIMATION; INAPPROXIMABILITY; MINIMUM SPANNING TREES; NETWORK PRICING GAMES; POLYNOMIAL-TIME ALGORITHMS; STACKELBERG GAMES;

COSTS;

EID: 45749097809     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. G. Aggarwal, T. Feder, R. Motwani, and A. Zhu. Algorithms for Multi-Product Pricing. In Proc. of 31st ICALP, 2004.
2. N. Balean and A. Blum. Approximation Algorithms and Online Mechanisms for Item Pricing. In Proc. of 7th EC, 2006.
3. N. Balean, A. Blum, J. Hartline, and Y. Mansour. Mechanism Design via Machine Learning. In Proc. of 46th FOCS, 2005.
4. M. Balean, A. Blum, and Y. Mansour. Single Price Mechanisms for Revenue Maximization in Unlimited Supply Combinatorial Auctions. Technical Report CMU-CS-07-111, Carnegie Mellon University, 2007.
5. M. Bouhtou, A. Grigoriev, S. van Hoesel, A. van der Kraaij, F. Spieksma, and M. Uetz. Pricing Bridges to Cross a River. Naval Research Logistics, 54(4): 411-420, 2007.
6. P. Briest. Towards Hardness of Envy-Free Pricing. ECCC Technical Report TR06-150, 2006.
7. P. Briest and P. Krysta. Single-Minded Unlimited-Supply Pricing on Sparse Instances. In Proc. of 17th SODA, 2006.
8. P. Briest and P. Krysta. Buying Cheap is Expensive: Hardness of Non-Parametric Multi-Product Pricing. In Proc. of 18th SODA, 2007.
9. J. Cardinal, E. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and O. Weimann. The Stackelberg Minimum Spanning Tree Game. In Proc. of 10th WADS, 2007.
10. S. Chawla, J. Hartline, and R. Kleinberg. Algorithmic Pricing via Virtual Valuations. In Proc. of 8th EC, 2007.
11. R. Cole, Y. Dodis, and T. Roughgarden. Pricing Network Edges for Heterogeneous Selfish Users. In Proc. of 35th STOC, 2003.
12. P. Cramton, Y. Shoham, and R. Steinberg (Editors). Combinatorial Auctions. MIT Press, 2006.
13. E.D. Demaine, U. Feige, M.T. Hajiaghayi, and M.R. Salavatipour. Combination Can Be Hard: Approximability of the Unique Coverage Problem. In Proc. of 17th SODA, 2006.
14. P. Glynn, P. Rusmevichientong, and B. Van Roy. A Non-Parametric Approach to Multi-Product Pricing. Operations Research, 54(1):82-98, 2006.
15. V. Guruswami, J.D. Hartline, A.R. Karlin, D. Kempe, C. Kenyon, and F. McSherry. On Profit-Maximizing Envy-Free Pricing. In Proc. of 16th SODA, 2005.
16. J. Hartline and V. Koltun. Near-Optimal Pricing in Near-Linear Time. In Proc. of 8th WADS, 2005.
17. M. Labbé, P. Marcotte, and G. Savard. A Bilevel Model of Taxation and its Application to Optimal Highway Pricing. Management Science, 44(12): 1608-1622, 1998.
18. N. Nisan and A. Ronen. Algorithmic Mechanism Design. In Proc. of 31st STOC, 1999.
19. S. Roch, G. Savard, and P. Marcotte. An Approximation Algorithm for Stackelberg Network Pricing. Networks, 46(1): 57-67, 2005.
20. T. Roughgarden. Stackelberg Scheduling Strategies. SIAM J. on Computing, 33(2): 332-350, 2004.
21. C. Swamy. The Effectiveness of Stackelberg Strategies and Tolls for Network Congestion Games. In Proc. of 18th SODA, 2007.
22. S. van Hoesel. An Overview of Stackelberg Pricing in Networks. Research Memoranda 042, METEOR, Maastricht, 2006.
23. H. von Stackelberg. Marktform und Gleichgewicht (Market and Equilibrium). Verlag von Julius Springer, Vienna, 1934.