Stackelberg scheduling strategies

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 104-113

  Roughgarden, T ^a  

^a Cornell University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SYSTEMS; OPTIMAL SYSTEMS; OPTIMIZATION;

STACKELBERG STRATEGY;

SCHEDULING;

EID: 0034833611     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380783     Document Type: Conference Paper

References (30)

1. Recommendations on queue management and congestion avoidance in the Internet
2. A simple network management protocol
3. Pricing in computer networks: Motivation, formulation, and example
4. The traffic assignment problem for a general network
5. Multilevel flow control of queues
6. A game theoretic perspective to flow control in telecommunication networks
7. Inefficiency of Nash equilibria
8. Priority load sharing: An approach using Stackelberg games
9. Sharing the cost of multicast transmissions
10. Achieving network optima using Stackelberg routing strategies
11. Capacity allocation under noncooperative routing
12. Avoiding the Braess paradox in noncooperative networks
13. Worst-case equilibria
14. Algorithms for selfish agents: Mechanism design for distributed computation
15. Algorithmic mechanism design
16. Competitive routing in multi-user communication networks
17. The maximum capture problem including relocation
18. How bad is selfish routing?
19. Making greed work in networks: A game-theoretic analysis of switch service disciplines