Improved results for stackelberg scheduling strategies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2380 LNCS, Issue , 2002, Pages 776-787

  Kumar, V S Anil ^a   Marathe, Madhav V ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; GAME THEORY;

LATENCY FUNCTION; NONCOOPERATIVE GAME; PARALLEL MACHINE; SCHEDULING STRATEGIES; SELFISH USERS; STACKELBERG;

SCHEDULING;

EID: 84869173990     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45465-9_66     Document Type: Conference Paper

References (16)

1. M. Beckman, C. Mcguire and C. Winstein. Studies in the Economics of Transportation. Yale University Press, 1956.
2. 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.
3. J. Carrahan, P. Russo, K. Kitami and R. Kung. Intelligent Network Overview. IEEE Communications Magzine, 31, pp. 30-36, 1993.
4. 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.
5. T. O'Connell, and R. Stearns. Polynomial Time Mechanisms for Collective Decision Making. Game Theory and Decision Theory in Agent-Based Systes. S. Parsons, P. Gmytrasiewicz, P. and M. Wooldridge, (eds.), Kluwer Academic Publishers, 2000.
6. S. Deering and R. Hinden. Internet Protocol Version 6 Specification. Internet Draft IETF March 1995.
7. 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.
8. 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.
9. E. Koutsoupias and C. Papadimitriou. Worst-Case Equilibria. Proc. 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), pp. 403-413, 1999.
10. Y. Korillis, A. Lazar and A. Orda. Capacity Allocation Under Non-cooperative Routing. IEEE Transactions on Automatic Control. 42(3), pp. 309-325, 1997.
11. N. Nisan and A. Ronen. Algorithmic Mechanism Design. Proc. 31st Annual ACM Symposium on Theory of Computing (STOC). pp. 129-140, 1999.
12. C. Papadimitriou. Algorithms, games and the Internet. Proc. 33rd Annual ACM Symposium on Theory of Computing. pp. 749-753, 2001.
13. T.Roughgarden. Stackelberg Scheduling Strategies. Proc. 31st ACM Symposium on Theory of Computing (STOC). pp. 2001.
14. T.Roughgarden and E.Tardos. How bad is Selfish Routing. Proc. 41st Annual Symposium on Foundations of Computer Science. pp. 93-102, 2000.
15. C. Saraydar, N. Mandayam and D. Goodman. Efficient Power Control via Pricing in Wireless Data Networks To Appear in IEEE Trans. on Communications, 2001.
16. http://www.lanl.gov/orgs/d/d5/projects/MESA/mesa.html http://www.lanl.gov/orgs/d/d2/projects.html.