Approximate Equilibria and Ball Fusion

Theory of Computing Systems

Volumn 36, Issue 6, 2003, Pages 683-693

  Koutsoupias, Elias ^a,b   Mavronicolas, Marios ^c   Spirakis, Paul ^d,e  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF ATHENS   (Greece)

^c UNIVERSITY OF CYPRUS   (Cyprus)

^d UNIVERSITY OF PATRAS   (Greece)

^e Univ of Patras   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

MULTIOBJECTIVE PROBLEMS; SADDLE-POINT EQUILIBRIUM;

APPROXIMATION THEORY; GAME THEORY; PARALLEL PROCESSING SYSTEMS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; ROUTERS; TELECOMMUNICATION TRAFFIC;

TELECOMMUNICATION NETWORKS;

EID: 0346361532     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1131-5     Document Type: Conference Paper

References (19)

1. Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal, Balanced Allocations, SIAM Journal on Computing, Vol. 29, No. 1, pp. 180-200, September 1999.
2. P. Berenbrink, F. Meyer auf der Heide, and K. Schröder, Allocating Weighted Jobs in Parallel, Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 302-310, June 1997.
3. H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations, Annals of Mathematical Statistics, Vol. 23, No. 4, pp. 493-509, December 1952.
4. A. Czumaj and B. Vöcking, Tight Bounds for Worst-case Equilibria. Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 413-420, January 2002.
5. A. Czumaj, P. Krysta, and B. Vöcking, Selfish Traffic Allocation for Server Farms, Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC' 02), Montreal, Quebec, pp. 287-296, May 19-21, 2002.
6. W. Hoeffding, Probability Inequalities for Sums of Bounded Random Variables, American Statistical Association Journal, Vol. 58, No. 301, pp. 13-30, 1963.
7. E. Koutsoupias, M. Mavronicolas, and P. Spirakis, A Tight Bound on Coordination Ratio, Technical Report 010029, Department of Computer Science, University of California at Los Angeles, 2001.
8. V. F. Kolchin, V. P. Chistiakov, and B. A. Sevastianov, Random Allocations, Winston, New York, 1978.
9. Y. Korilis, A. Lazar and A. Orda, Architecting Noncooperative Networks, IEEE Journal on Selected Areas in Communications, Vol. 13, No. 7, pp. 1241-1251, September 1995.
10. E. Koutsoupias and C. H. Papadimitriou, Worst-Case Equilibria, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, G. Meinel and S. Tison, eds., pp. 404-413, Lecture Notes in Computer Science, Vol. 1563, Springer-Verlag, Berlin, March 1999.
11. M. Mavronicolas and P. Spirakis, The Price of Selfish Routing, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 510-519, July 2001.
12. M. Mitzenmacher, A. W. Richa, and R. Sitaraman, The Power of Two Random Choices: A Survey of Techniques and Results, Handbook of Randomized Computing, Kluwer, Dordrecht, 2001.
13. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
14. R. B. Myerson, Refinement of the Nash Equilibrium Concept, Journal of Game Theory, Vol. 7, pp. 73-80, 1978.
15. J. F. Nash, Non-Cooperative Games, Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
16. J. von Neumann and O. Morgenstern, Theory of Games and Economic Behavior (second edition), Princeton University Press, Princeton, NJ, 1947.
17. M. J. Osborne and A. Rubinstein, A Course in Game Theory, The MIT Press, Cambridge, MA, 1994.
18. R. Selten, Reexamination of the Perfectness Concept for Equilibrium Points in Extensive Games, International Journal of Game Theory, Vol. 4, pp. 25-55, 1975.
19. H. von Stackelberg, The Theory of the Market Economy, Oxford University Press, Oxford, 1934.