The study of congestion games is central to the interplay between computer science and game theory. However, most work in this context does not deal with possible deviations by coalitions of players, a significant issue one may wish to consider. In order to deal with this issue we study the existence of strong and correlated strong equilibria in monotone congestion games. Our study of strong equilibrium deals with monotone-increasing congestion games, complementing the results obtained by Holzman and Law-Yone on monotone-decreasing congestion games. We then present a study of correlated-strong equilibrium for both decreasing and increasing monotone congestion games. © 2006 Springer-Verlag.
CITATION STYLE
Rozenfeld, O., & Tennenholtz, M. (2006). Strong and correlated strong equilibria in monotone congestion games. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4286 LNCS, pp. 74–86). https://doi.org/10.1007/11944874_8
Mendeley helps you to discover research relevant for your work.