메뉴 건너뛰기




Volumn 3580, Issue , 2005, Pages 497-512

Braess's Paradox, Fibonacci numbers, and exponential inapproximability

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; NUMBER THEORY; POLYNOMIALS; ROUTERS;

EID: 26444538912     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11523468_41     Document Type: Conference Paper
Times cited : (19)

References (25)
  • 3
    • 34250513249 scopus 로고
    • Über ein Paradoxon aus der Verkehrsplanung
    • D. Braess. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, 12:258-268, 1968.
    • (1968) Unternehmensforschung , vol.12 , pp. 258-268
    • Braess, D.1
  • 4
    • 0038487607 scopus 로고    scopus 로고
    • The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands
    • C. K. Chau and K. M. Sim. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Operations Research Letters, 31(5):327-335, 2003.
    • (2003) Operations Research Letters , vol.31 , Issue.5 , pp. 327-335
    • Chau, C.K.1    Sim, K.M.2
  • 5
    • 33745585248 scopus 로고    scopus 로고
    • Computational complexity, fairness, and the price of anarchy of the maximum latency problem
    • Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO)
    • J. R. Correa, A. S. Schulz, and N. E. Stier Moses. Computational complexity, fairness, and the price of anarchy of the maximum latency problem. In Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 3064 of Lecture Notes in Computer Science, pages 59-73, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3064 , pp. 59-73
    • Correa, J.R.1    Schulz, A.S.2    Moses, N.E.S.3
  • 10
    • 33744911424 scopus 로고    scopus 로고
    • Selfish routing in non-cooperative networks: A survey
    • Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS)
    • R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Selfish routing in non-cooperative networks: A survey. In Proceedings of the Conference on Mathematical Foundations of Computer Science (MFCS), volume 2747 of Lecture Notes in Computer Science, pages 21-45, 2003.
    • (2003) Lecture Notes in Computer Science , vol.2747 , pp. 21-45
    • Feldmann, R.1    Gairing, M.2    Lücking, T.3    Monien, B.4    Rode, M.5
  • 12
    • 5544317207 scopus 로고    scopus 로고
    • Efficiency loss in a network resource allocation game
    • R. Johari and J. N. Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29(3):407-435, 2004.
    • (2004) Mathematics of Operations Research , vol.29 , Issue.3 , pp. 407-435
    • Johari, R.1    Tsitsiklis, J.N.2
  • 16
    • 35048893788 scopus 로고    scopus 로고
    • The price of anarchy when costs are non-separable and asymmetric
    • Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO)
    • G. Perakis. The price of anarchy when costs are non-separable and asymmetric. In Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 3064 of Lecture Notes in Computer Science, pages 46-58, 2004.
    • (2004) Lecture Notes in Computer Science , vol.3064 , pp. 46-58
    • Perakis, G.1
  • 18
    • 0141965143 scopus 로고    scopus 로고
    • The price of anarchy is independent of the network topology
    • T. Roughgarden. The price of anarchy is independent of the network topology. Journal of Computer and System Sciences, 67(2):341-364, 2003.
    • (2003) Journal of Computer and System Sciences , vol.67 , Issue.2 , pp. 341-364
    • Roughgarden, T.1
  • 21
    • 0038183237 scopus 로고    scopus 로고
    • How bad is selfish routing?
    • T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
    • (2002) Journal of the ACM , vol.49 , Issue.2 , pp. 236-259
    • Roughgarden, T.1    Tardos, E.2
  • 22
    • 1942509632 scopus 로고    scopus 로고
    • Bounding the inefficiency of equilibria in nonatomic congestion games
    • T. Roughgarden and E. Tardos. Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior, 47(2):389-403, 2004.
    • (2004) Games and Economic Behavior , vol.47 , Issue.2 , pp. 389-403
    • Roughgarden, T.1    Tardos, E.2
  • 23
    • 0018656183 scopus 로고
    • The existence, uniqueness and stability of traffic equilibria
    • M. J. Smith. The existence, uniqueness and stability of traffic equilibria. Transportation Research, 13B:295-304, 1979.
    • (1979) Transportation Research , vol.13 B , pp. 295-304
    • Smith, M.J.1
  • 24
    • 0036948876 scopus 로고    scopus 로고
    • Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions
    • A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), pages 416-425, 2002.
    • (2002) Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS) , pp. 416-425
    • Vetta, A.1


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