Conflict and cooperation in designing international telecommunication networks

Journal of the Operational Research Society

Volumn 48, Issue 6, 1997, Pages 600-611

  Anandalingam, G ^a   Nam, K ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Cooperative; Games; Global networks; Non cooperative games; Telecommunications

Indexed keywords

DATA COMMUNICATION SYSTEMS; GAME THEORY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; TELECOMMUNICATION; TELECOMMUNICATION TRAFFIC;

COOPERATIVE GAMES; GLOBAL NETWORKS; INTERNATIONAL TELECOMMUNICATION NETWORKS; NON COOPERATIVE GAMES;

TELECOMMUNICATION NETWORKS;

EID: 0031162762     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2600404     Document Type: Article

References (18)

1. Anandalingam, G., Dadhabhoy, A., (1996). The Telecommunications Revolution in Asia. In Working Paper, Wharton Emerging Economies Program. University of Pennsylvania. March.
2. A T and;amp; T., (1991). The World's Telephones: A Statistical Compilation as of January 1990. ATand;amp;T.
3. Gibbens R J., Kelly F P., Cope G A., Whitehead M J., (1991). Coalitions in the international network. Teletraffic and Datatraf fic in a Period of Change, ITC-13 14: 93-98.
4. Watanabe Y., Mori H., (1988). Dynamic routing schemes for international isdns. In: Bonatti M and Decina M (eds). Traffic Engineering for ISDN Design and Planning. Elsevier Science Publishers: B.V., pp 299-308.
5. Owen G., (1968). Game Theory. W.B. Saunders: Philadelphia.
6. Shubik M., (1982). Game Theory in the Social Sciences: Concepts and Solutions. The MIT Press: Cambridge, MA.
7. von Neumann J., Morgenstern O., (1944). Theory of Games and Economic Behavior. Princeton University Press: Princeton.
8. Littlechild S C., (1970). A game theoretic approach to public utility pricing. Western Econ J 8: 162-166.
9. Billera L J., Heath D C., Raanan J., (1978). Internal telephone billing ratesÐa novel application of non-atomic game theory. Opns Res 26: 956-965.
10. Aumann R J., Shapley L S., (1974). Values of Non-Atomic Games. Princeton University Press: Princeton.
11. Peyton-Young H., (1985). Methods and principles of cost allocation. In: Peyton-Young H (ed). Cost Allocation: Methods, Principles, Applications. North-Holland, pp 3-29.
12. Anandalingham G., (1988). A mathematical programming model of multi-level hierarchical systems. J Opl Res Soc 39: 1021- 1033.
13. Bertsekas D P., Gafni E M., (1982). Projection methods for variational inequalities with application to the traffic assignment problem. Math Prog Study 17: 139-159.
14. Tobin R L., Friesz T L., (1986). Spatial competition facility location models: Definition, formulation and solution approach. Ann Opns Res 6: 49-74.
15. Anandalingham G., Friesz T L., (1992). Hierarchical optimization: An introduction. Ann Opns Res 34: 1-11.
16. Lee F., Anandalingam G., (1994). On the choice of bridges and routers as inter-networking devices. Working Paper 94-14, Dept of Systems Engineering, University of Pennsylvania.
17. Nam K., (1994). International Telecommunications Networks: Modeling and Analysis. PhD thesis, University of Pennsylvania, Dept. of Systems Engineering, Philadelphia, PA.
18. Bard J F., Moore J J., (1990). A branch-and-bound algorithm for the bilevel linear programming problem. SIAM J Sci Stat Comput 11: 281-292.