메뉴 건너뛰기
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volumn 3828 LNCS, Issue , 2005, Pages 1066-1075
Price of anarchy of network routing games with incomplete information
Author keywords

[No Author keywords available]
Indexed keywords

COMPUTER NETWORKS; INFORMATION DISSEMINATION; INTELLIGENT AGENTS; MATHEMATICAL MODELS; PROBABILITY DISTRIBUTIONS; ROUTERS; TELECOMMUNICATION TRAFFIC;
EID: 33744918763     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_107     Document Type: Conference Paper
Times cited : (12)
References (10)
  • 1
    • 84968906622 scopus 로고    scopus 로고
    • Tight bounds for worst case equilibria
    • San Francisco, CA, January 6-8
    • A. Czumaj and B. Vöcking. Tight bounds for worst case equilibria. In ACM-SIAM SODA '02, pages 413-420, San Francisco, CA, January 6-8 2002.
    • (2002) ACM-SIAM SODA '02 , pp. 413-420
    • Czumaj, A.1    Vöcking, B.2
  • 2
    • 33744911424 scopus 로고    scopus 로고
    • Selfish routing in non-cooperative networks: A survey
    • LNCS 2747, March 25-27
    • Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, and Manuel Rode. Selfish routing in non-cooperative networks: A survey. In MFCS'03, pages 21-45, LNCS 2747, March 25-27 2003.
    • (2003) MFCS'03 , pp. 21-45
    • Feldmann, R.1    Gairing, M.2    Lücking, T.3    Monien, B.4    Rode, M.5
  • 3
    • 32144445597 scopus 로고    scopus 로고
    • Selfish routing with incomplete information
    • Las Vegas, NV, June 30-July 4
    • Martin Gairing, Burkhard Monien, and Karsten Tiemann. Selfish routing with incomplete information. In SPAA 05, Las Vegas, NV, June 30-July 4 2005.
    • (2005) SPAA 05
    • Gairing, M.1    Monien, B.2    Tiemann, K.3
  • 4
    • 33744907541 scopus 로고    scopus 로고
    • Price of anarchy for routing games with incomplete information
    • Dept. of Computer Science and Automation, IISc
    • D. Garg and Y. Narahari. Price of anarchy for routing games with incomplete information. Technical report, Dept. of Computer Science and Automation, IISc, http://people.csa.iisc.ernet.in/dgarg/, 2005.
    • (2005) Technical Report
    • Garg, D.1    Narahari, Y.2
  • 5
    • 0000725056 scopus 로고
    • Games with incomplete information played by 'Bayesian' Players
    • J.C. Harsanyi. Games with incomplete information played by 'Bayesian' Players. Management Science, 14:159-182, 320-334, 486-502, 1967-68.
    • (1967) Management Science , vol.14 , pp. 159-182
    • Harsanyi, J.C.1
  • 6
    • 84864657941 scopus 로고    scopus 로고
    • Papadimitriou. Worst-case equilibria
    • Paris, France, February 25-27
    • Elias Koutsoupias and Christos H. Papadimitriou. Worst-case equilibria. In STACS'98, pages 404-413, Paris, France, February 25-27 1998.
    • (1998) STACS'98 , pp. 404-413
    • Koutsoupias, E.1    Christos, H.2
  • 7
    • 35048897477 scopus 로고    scopus 로고
    • A new model for selfish routing
    • LNCS 2996, Montpellier, France, March 25-27
    • Thomas Lücking, Marios Mavronicolas, Burkhard Monien, and Manuel Rode. A new model for selfish routing. In STACS'04, pages 547-558, LNCS 2996, Montpellier, France, March 25-27 2004.
    • (2004) STACS'04 , pp. 547-558
    • Lücking, T.1    Mavronicolas, M.2    Monien, B.3    Rode, M.4
  • 9
    • 0001072426 scopus 로고    scopus 로고
    • Algorithms, games, and the Internet
    • Hersonissos, Crete, Greece, July 6-8
    • Christos H. Papadimitriou. Algorithms, games, and the Internet. In ACM STOC'01, Hersonissos, Crete, Greece, July 6-8 2001.
    • (2001) ACM STOC'01
    • Papadimitriou, C.H.1

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