Atomic resource sharing in noncooperative networks

Telecommunication Systems

Volumn 17, Issue 4, 2001, Pages 385-409

  Libman, Lavy ^a   Orda, Ariel ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Atomic resource sharing; Nash equilibria; Nonbifurcated resource sharing; Noncooperative networks; Routing

Indexed keywords

EID: 23044527161     PISSN: 10184864     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1016770831869     Document Type: Article

References (18)

1. E. Altman, Flow control using the theory of zero-sum Markov games, IEEE Transactions on Automatic Control 39(4) (April 1994) 814-818.
2. R. Cocchi, S. Shenker, D. Estrin and L. Zhang, Pricing in computer networks: Motivation, formulation and example, IEEE/ACM Transactions on Networking 1(6) (December 1993) 614-627.
3. A.A. Economides and J.A. Silvester, Multi-objective routing in integrated services networks: A game theory approach, in: Proc. of INFOCOM'91, Bal Harbor, FL, April 1991, pp. 1220-1225.
4. M.R. Garey and D.S. Johnson, Computers and Intractability (Freeman, San Francisco, 1979).
5. M.T. Hsiao and A.A. Lazar, Optimal decentralized flow control of Markovian queueing networks with multiple controllers, Performance Evaluation 13(3) (1991) 181-204.
6. A. Kershenbaum, Telecommunications Network Design Algorithms (McGraw-Hill, New York, 1993).
7. Y. Kim, Equilibrium selection in n-person coordination games, Games and Economic Behavior 15(2) (1996) 203-227.
8. Y.A. Korilis and A.A. Lazar, On the existence of equilibria in noncooperative optimal flow control, Journal of the ACM 42(3) (May 1995) 584-613.
9. Y.A. Korilis, A.A. Lazar and A. Orda, Achieving network optima using Stackelberg routing strategies, IEEE/ACM Transactions on Networking 5(1) (February 1997) 161-173.
10. Y.A. Korilis, A.A. Lazar and A. Orda, Capacity allocation under noncooperative routing, IEEE Transactions on Automatic Control 42(3) (March 1997) 309-325.
11. Y.A. Korilis, T.A. Varvarigou and S.A. Ahuja, Incentive-compatible pricing strategies in noncooperative networks, in: Proc. of INFOCOM'98, San Francisco, CA, March 1998.
12. A.A. Lazar, A. Orda and D.E. Pendarakis, Virtual path bandwidth allocation in multi-user networks, in: Proc. of INFOCOM'95, Boston, MA, April 1995, pp. 312-320.
13. L. Libman and A. Orda, The Designer's perspective to atomic noncooperative networks, IEEE/ACM Transactions on Networking 7(6) (December 1999) 875-884.
14. J.K. MacKie-Mason and H.R. Varian, Pricing congestible network resources, IEEE Journal on Selected Areas in Communications 13(7) (September 1995) 1141-1149.
15. R.B. Myerson, Game Theory: Analysis of Conflict (Harvard Univ. Press, Cambridge, MA, 1991).
16. A. Orda, R. Rom and N. Shimkin, Competitive routing in multiuser communication networks, IEEE/ACM Transactions on Networking 1(5) (October 1993) 510-521.
17. L.G. Valiant and V.V. Vazirani, NP is as easy as detecting unique solutions, in: Proc. of the 17th Symposium on the Theory of Computing (STOC), Providence, RI, May 1985, pp. 458-463.
18. Z. Zhang and C. Douligeris, Convergence of synchronous and asynchronous greedy algorithms in a multiclass telecommunications environment, IEEE Transactions on Computers 40(8) (August 1992) 1277-1281.