메뉴 건너뛰기




Volumn 5385 LNCS, Issue , 2008, Pages 222-230

Performance evaluation of a descent algorithm for Bi-matrix games

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GAME THEORY; INTERNET; PARALLEL PROCESSING SYSTEMS; WINE;

EID: 58849128680     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_29     Document Type: Conference Paper
Times cited : (14)

References (7)
  • 1
    • 38449115856 scopus 로고    scopus 로고
    • Tsaknakis, H., Spirakis, P.G.: An Optimization Approach for Approximate Nash Equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, 4858, pp. 42-56. Springer, Heidelberg (2007)
    • Tsaknakis, H., Spirakis, P.G.: An Optimization Approach for Approximate Nash Equilibria. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 42-56. Springer, Heidelberg (2007)
  • 2
    • 70349123254 scopus 로고    scopus 로고
    • Kontogiannis, S., Panagopoulou, P., Spirakis, P.: Polynomial algorithms for approximating nash equilibria in bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, 4286, pp. 286-296. Springer, Heidelberg (2006)
    • Kontogiannis, S., Panagopoulou, P., Spirakis, P.: Polynomial algorithms for approximating nash equilibria in bimatrix games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 286-296. Springer, Heidelberg (2006)
  • 3
    • 38049069316 scopus 로고    scopus 로고
    • Efficient algorithms for constant well supported approximate equilibria of bimatrix games
    • Arge, L, Cachin, C, Jurdziński, T, Tarlecki, A, eds, ICALP 2007, Springer, Heidelberg
    • Kontogiannis, S., Spirakis, P.G.: Efficient algorithms for constant well supported approximate equilibria of bimatrix games. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596. Springer, Heidelberg (2007)
    • (2007) LNCS , vol.4596
    • Kontogiannis, S.1    Spirakis, P.G.2
  • 4
    • 36448948767 scopus 로고    scopus 로고
    • Settling the complexity of 2-player nash equilibrium
    • IEEE Comp. Soc. Press, Los Alamitos
    • Chen, X., Deng, X.: Settling the complexity of 2-player nash equilibrium. In: Proc. of the 47th IEEE Symp. on Found, of Comp. Sci (FOCS 2006), pp. 261-272. IEEE Comp. Soc. Press, Los Alamitos (2006)
    • (2006) Proc. of the 47th IEEE Symp. on Found, of Comp. Sci (FOCS , pp. 261-272
    • Chen, X.1    Deng, X.2
  • 6
    • 70349159750 scopus 로고    scopus 로고
    • Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, 4286, pp. 297-306. Springer, Heidelberg (2006)
    • Daskalakis, C., Mehta, A., Papadimitriou, C.: A note on approximate nash equilibria. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 297-306. Springer, Heidelberg (2006)
  • 7
    • 38449120279 scopus 로고    scopus 로고
    • Boss, H., Byrka, J., Markakis, E.: New Algorithms for Approximate Nash Equilibria in Bimatrix Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, 4858, pp. 17-29. Springer, Heidelberg (2007)
    • Boss, H., Byrka, J., Markakis, E.: New Algorithms for Approximate Nash Equilibria in Bimatrix Games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 17-29. Springer, Heidelberg (2007)


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