Optimal routing control: Repeated game approach

IEEE Transactions on Automatic Control

Volumn 47, Issue 3, 2002, Pages 437-450

  La, Richard J ^b   Anantharam, Venkat ^a,c  

^a IEEE

^b UNIVERSITY OF MARYLAND   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Game theory; Nash equilibrium; Routing control

Indexed keywords

GAME THEORY; OPTIMIZATION; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

NASH EQUILIBRIUM POINT (NEP);

ROUTERS;

EID: 0036493482     PISSN: 00189286     EISSN: None     Source Type: Journal    
DOI: 10.1109/9.989076     Document Type: Article

References (26)

1. Pricing in computer networks: Motivation, formulation, and example
2. A game theoretic perspective to flow control in telecommunication networks
3. Fair-efficient call admission control policies for broadband networks - A game theoretic framework
4. Inefficiency of Nash equilibria
5. A noncooperative equilibrium for supergames
6. Multi-objective routing in integrated services networks: A game theory approach
7. The folk theorem in repeated games with discounting or with incomplete information
8. On the relationship between Nash-Cournot and Wardrop equilibria
9. Amhitecting noncooperative networks
10. Capacity allocation under noncooperative routing
11. Achieving network optima using Stackelberg routing strategies
12. On the existence of equilibria in non-cooperative optimal flow control
13. Decentralized algorithms for optimal flow control
14. Optimal decentralized flow control of Markovian queueing networks with multiple controllers
15. Virtual path bandwidth allocation in multi-user networks
16. Multi-agent customer allocation in a stochastic service system
17. Competitive routing in multiuser communication networks
18. Existence and uniqueness of equilibrium points for concave n-person games
19. Efficient network allocations with selfish users
20. A packet routing based on game theory
21. A packet routing method based on game theory