-
1
-
-
38049022208
-
On the impact of combinatorial structure on congestion games
-
Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: FOCS, pp. 613-622 (2006)
-
(2006)
FOCS
, pp. 613-622
-
-
Ackermann, H.1
Röglin, H.2
Vöcking, B.3
-
2
-
-
70349085131
-
Fast convergence to nearly optimal solutions in potential games
-
Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: ACM Conference on Electronic Commerce, pp. 264-273 (2008)
-
(2008)
ACM Conference on Electronic Commerce
, pp. 264-273
-
-
Awerbuch, B.1
Azar, Y.2
Epstein, A.3
Mirrokni, V.S.4
Skopalik, A.5
-
4
-
-
33745615776
-
-
Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS, pp. 349-360 (2006)
-
Christodoulou, G., Mirrokni, V.S., Sidiropoulos, A.: Convergence and approximation in potential games. In: STACS, pp. 349-360 (2006)
-
-
-
-
5
-
-
4544358281
-
The complexity of pure nash equilibria
-
Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure nash equilibria. In: STOC, pp. 604-612 (2004)
-
(2004)
STOC
, pp. 604-612
-
-
Fabrikant, A.1
Papadimitriou, C.H.2
Talwar, K.3
-
6
-
-
33646420334
-
Market sharing games applied to content distribution in ad hoc networks
-
Goemans, M.X., Li, L., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad hoc networks. IEEE Journal on Selected Areas in Communications 24(5), 1020-1033 (2006)
-
(2006)
IEEE Journal on Selected Areas in Communications
, vol.24
, Issue.5
, pp. 1020-1033
-
-
Goemans, M.X.1
Li, L.2
Mirrokni, V.S.3
Thottan, M.4
-
7
-
-
0002445280
-
How easy is local search?
-
Johnson, D.S., Papadimitriou, C.H., Yannakakis, M.: How easy is local search? J. Comput. Syst. Sci. 37(1), 79-100 (1988)
-
(1988)
J. Comput. Syst. Sci
, vol.37
, Issue.1
, pp. 79-100
-
-
Johnson, D.S.1
Papadimitriou, C.H.2
Yannakakis, M.3
-
8
-
-
0001730497
-
Noncooperative games
-
Nash, J.F.: Noncooperative games. Annals of Mathematics 54, 289-295 (1951)
-
(1951)
Annals of Mathematics
, vol.54
, pp. 289-295
-
-
Nash, J.F.1
-
9
-
-
34250442766
-
A class of games possessing pure-strategy nash equilibria
-
Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2, 65-67 (1973)
-
(1973)
International Journal of Game Theory
, vol.2
, pp. 65-67
-
-
Rosenthal, R.W.1
-
10
-
-
0038183237
-
How bad is selfish routing?
-
Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236-259 (2002)
-
(2002)
J. ACM
, vol.49
, Issue.2
, pp. 236-259
-
-
Roughgarden, T.1
Tardos, E.2
-
11
-
-
57049105860
-
Inapproximability of pure nash equilibria
-
Skopalik, A., Vöcking, B.: Inapproximability of pure nash equilibria. In: STOC, pp. 355-364 (2008)
-
(2008)
STOC
, pp. 355-364
-
-
Skopalik, A.1
Vöcking, B.2
-
12
-
-
84926076737
-
Network formation games and the potential function method
-
Nisan, N, Roughgarden, T, Tardos, E, Vazirani, V, eds, ch. 19. Cambridge University, Cambridge
-
Tardos, E., Wexler, T.: Network formation games and the potential function method. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, ch. 19. Cambridge University, Cambridge (2007)
-
(2007)
Algorithmic Game Theory
-
-
Tardos, E.1
Wexler, T.2
|