Abstract
We continue the study initiated in [13] on Stackelberg Scheduling Strategies. We are given a set of m independent parallel machines or equivalently a set of m parallel edges, each with a load dependent latency function. The setting is that of a non-cooperative game: players route their flow so as minimize their individual latencies. Additionally, there is a single player (the leader), who controls an α fraction of the total flow. The goal is to find a strategy for the leader (i.e. an assignment of flow to individual links) such that the selfish users react so as to minimize the total latency of the system. Building on the recent results in [13,14], we devise a fully polynomial approximate Stackelberg scheme that runs in time poly(m, 1/∈) and results in an assignment whose cost is within a (1 + ∈) factor of the optimum Stackelberg strategy. We also study the generalization to multiple rounds. It is easy to see that more than two rounds do not help. We show that the two round Stackelberg strategy (denoted 2SS) always dominates the one round scheme. We also consider extensions of the above results to special graphs, and special kind of latency functions.
Work supported by the Department of Energy under Contract W-7405-ENG-36.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Beckman, C. Mcguire and C. Winstein. Studies in the Economics of Transportation. Yale University Press, 1956.
J. Bennett, C. Partridge and N. Shectman. “Packet reordering is not Pathological Network Behavior,” IEEE/ACM Transactions on Networking, 7(6), Dec. 1999, pp. 789–798.
J. Carrahan, P. Russo, K. Kitami and R. Kung. Intelligent Network Overview. IEEE Communications Magzine, 31, pp. 30–36, 1993.
R. Cocchi, S. Shenker, D. Estrin and L. Zhang. Pricing in Computer Networks: Motivation, Formulation and Example. IEEE/ACM Transactions on Networking. 1(6), pp. 614–627, 1993.
T. O’Connell, and R. Stearns. Polynomial Time Mechanisms for Collective Decision Making. Game Theory and Decision Theory in Agent-Based Systems. S. Parsons, P. Gmytrasiewicz, P. and M. Wooldridge, (eds.), Kluwer Academic Publishers, 2000.
S. Deering and R. Hinden. Internet Protocol Version 6 Specification. Internet Draft IETF March 1995.
S. Dafermos and F. Sparrow. The Traffic Assignment Problem for a General Network. J. Research of the National Bureau of Standards Series B. 73B(2), pp. 91–118, 1969.
Y. Korillis, A. Lazar and A. Orda. Achieving Network Optima Using Stackelberg Routing Strategies. IEEE/ACM Transactions on Networking. 5(1), pp. 161–173, 1997.
E. Koutsoupias and C. Papadimitriou. Worst-Case Equilibria. Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 403–413, 1999.
Y. Korillis, A. Lazar and A. Orda. Capacity Allocation Under Non-cooperative Routing. IEEE Transactions on Automatic Control. 42(3), pp. 309–325, 1997.
N. Nisan and A. Ronen. Algorithmic Mechanism Design. Proc. 31st Annual ACM Symposium on Theory of Computing (STOC). pp. 129–140, 1999.
C. Papadimitriou. Algorithms, games and the Internet. Proc. 33rd Annual ACM Symposium on Theory of Computing. pp. 749–753, 2001.
T. Roughgarden. Stackelberg Scheduling Strategies. Proc. 31st ACM Symposium on Theory of Computing (STOC). pp. 2001.
T. Roughgarden and E. Tardos. How bad is Selfish Routing. Proc. 41st Annual Symposium on Foundations of Computer Science. pp. 93–102, 2000.
C. Saraydar, N. Mandayam and D. Goodman. Efficient Power Control via Pricing in Wireless Data Networks To Appear in IEEE Trans. on Communications, 2001.
http://www.lanl.gov/orgs/d/d5/projects/MESA/mesa.html http://www.lanl.gov/orgs/d/d2/projects.html.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, V.S.A., Marathe, M.V. (2002). Improved Results for Stackelberg Scheduling Strategies. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_66
Download citation
DOI: https://doi.org/10.1007/3-540-45465-9_66
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43864-9
Online ISBN: 978-3-540-45465-6
eBook Packages: Springer Book Archive