메뉴 건너뛰기




Volumn 343, Issue 1-2, 2005, Pages 133-157

Structure and complexity of extreme Nash equilibria

Author keywords

Extreme Nash equilibria; Selfish routing

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

EID: 25444507924     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.05.011     Document Type: Article
Times cited : (27)

References (31)
  • 1
    • 0001114898 scopus 로고    scopus 로고
    • Improving local search heuristics for some scheduling problems. Part II
    • P. Brucker, J. Hurink, and F. Werner Improving local search heuristics for some scheduling problems. Part II Discrete Applied Math. 72 1-2 1997 47 69
    • (1997) Discrete Applied Math. , vol.72 , Issue.1-2 , pp. 47-69
    • Brucker, P.1    Hurink, J.2    Werner, F.3
  • 3
    • 25444439453 scopus 로고    scopus 로고
    • R. Datta, Universality of Nash equilibria, Unpublished manuscript, August 2002
    • R. Datta, Universality of Nash equilibria, Unpublished manuscript, August 2002.
  • 5
    • 35248835014 scopus 로고    scopus 로고
    • Nashification and the coordination ratio for a selfish routing game
    • Proc. 30th Internat. Colloq. on Automata, Languages and Programming Springer, Berlin, June/July
    • R. Feldmann, M. Gairing, T. Lücking, B. Monien, M. Rode, Nashification and the coordination ratio for a selfish routing game, Proc. 30th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, June/July 2003, pp. 514-526.
    • (2003) Lecture Notes in Computer Science , vol.2719 , pp. 514-526
    • Feldmann, R.1    Gairing, M.2    Lücking, T.3    Monien, B.4    Rode, M.5
  • 6
    • 0018678342 scopus 로고
    • A linear time approximation algorithm for multiprocessor scheduling
    • G. Finn, and E. Horowitz A linear time approximation algorithm for multiprocessor scheduling BIT 19 1979 312 320
    • (1979) BIT , vol.19 , pp. 312-320
    • Finn, G.1    Horowitz, E.2
  • 7
    • 84869168491 scopus 로고    scopus 로고
    • The structure and complexity of Nash equilibria for a selfish routing game
    • Proc. 29th Internat. Colloq on Automata, Languages and Programming Springer, Berlin, July
    • D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, Proc. 29th Internat. Colloq on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, July 2002, pp. 123-134.
    • (2002) Lecture Notes in Computer Science , vol.2380 , pp. 123-134
    • Fotakis, D.1    Kontogiannis, S.2    Koutsoupias, E.3    Mavronicolas, M.4    Spirakis, P.5
  • 8
    • 0001627504 scopus 로고
    • Complexity results for multiprocessor scheduling under resource constraints
    • M.R. Garey, and D.S. Johnson Complexity results for multiprocessor scheduling under resource constraints SIAM J. Comput. 4 1975 397 411
    • (1975) SIAM J. Comput. , vol.4 , pp. 397-411
    • Garey, M.R.1    Johnson, D.S.2
  • 10
    • 0019552967 scopus 로고
    • Expected length of the longest probe sequence in Hash code searching
    • G.H. Gonnet Expected length of the longest probe sequence in Hash code searching J. ACM 28 2 1981 289 304
    • (1981) J. ACM , vol.28 , Issue.2 , pp. 289-304
    • Gonnet, G.H.1
  • 11
    • 0023170393 scopus 로고
    • Using dual approximation algorithms for scheduling problems: Theoretical and practical results
    • D.S. Hochbaum, and D. Shmoys Using dual approximation algorithms for scheduling problems: theoretical and practical results J. ACM 34 1 1987 144 162
    • (1987) J. ACM , vol.34 , Issue.1 , pp. 144-162
    • Hochbaum, D.S.1    Shmoys, D.2
  • 12
    • 0016943203 scopus 로고
    • Exact and approximate algorithms for scheduling non-identical processors
    • E. Horowitz, and S. Sahni Exact and approximate algorithms for scheduling non-identical processors J. ACM 23 2 1976 317 327
    • (1976) J. ACM , vol.23 , Issue.2 , pp. 317-327
    • Horowitz, E.1    Sahni, S.2
  • 13
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • R.E. Miller J.W. Thatcher Plenum Press New York
    • R.M. Karp Reducibility among combinatorial problems R.E. Miller J.W. Thatcher Complexity of Computer Computations 1972 Plenum Press New York 85 103
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 15
    • 0346361532 scopus 로고    scopus 로고
    • Approximate equilibria and ball fusion
    • E. Koutsoupias, M. Mavronicolas, and P. Spirakis Approximate equilibria and ball fusion Theory of Computing Systems 36 6 2003 683 693 (Earlier version appeared as "A Tight Bound on Coordination Ratio," Technical Report 0100229, Department of Computer Science, University of California at Los Angeles, April 2001.)
    • (2003) Theory of Computing Systems , vol.36 , Issue.6 , pp. 683-693
    • Koutsoupias, E.1    Mavronicolas, M.2    Spirakis, P.3
  • 16
    • 84864657941 scopus 로고    scopus 로고
    • Worst-case equilibria
    • Proc. 16th Annu. Symp. on Theoretical Aspects of Computer Science, G. Meinel, S. Tison (Eds.) Springer, Berlin, Trier, Germany, March
    • E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, Proc. 16th Annu. Symp. on Theoretical Aspects of Computer Science, G. Meinel, S. Tison (Eds.), Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, Trier, Germany, March 1999, pp. 404-413.
    • (1999) Lecture Notes in Computer Science , vol.1563 , pp. 404-413
    • Koutsoupias, E.1    Papadimitriou, C.H.2
  • 17
    • 35248876216 scopus 로고    scopus 로고
    • Which is the worst-case Nash equilibrium?
    • Proc. 26th Internat. Symp. on Mathematical Foundations of Computer Science Springer, Berlin, August
    • T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis, I. Vrto, Which is the worst-case Nash equilibrium? Proc. 26th Internat. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, August 2003, pp. 551-561.
    • (2003) Lecture Notes in Computer Science , vol.2747 , pp. 551-561
    • Lücking, T.1    Mavronicolas, M.2    Monien, B.3    Rode, M.4    Spirakis, P.5    Vrto, I.6
  • 21
    • 0000093296 scopus 로고
    • Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
    • H. Moulin, and L. Vial Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon Internat. J. Game Theory 7 3/4 1978 201 221
    • (1978) Internat. J. Game Theory , vol.7 , Issue.34 , pp. 201-221
    • Moulin, H.1    Vial, L.2
  • 22
    • 0002021736 scopus 로고
    • Equilibrium points in N-person games
    • J.F. Nash Equilibrium points in N-person games Proc. Natl. Acad. Sci. 36 1950 48 49
    • (1950) Proc. Natl. Acad. Sci. , vol.36 , pp. 48-49
    • Nash, J.F.1
  • 23
    • 0001730497 scopus 로고
    • Non-cooperative games
    • J.F. Nash Non-cooperative games Ann. Math. 54 2 1951 286 295
    • (1951) Ann. Math. , vol.54 , Issue.2 , pp. 286-295
    • Nash, J.F.1
  • 31
    • 0036948876 scopus 로고    scopus 로고
    • Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions
    • October
    • A. Vetta, Nash Equilibria in Competitive Societies, with Applications to Facility Location, Traffic Routing and Auctions, Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science, October 2002, pp. 416-425.
    • (2002) Proc. 43rd Annu. IEEE Symp. on Foundations of Computer Science , pp. 416-425
    • Vetta, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.