Proceedings of the twenty-second annual symposium on Principles of distributed computing
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Strong and correlated strong equilibria in monotone congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
On Nash Equilibria for a Network Creation Game
ACM Transactions on Economics and Computation
| Hi-index | 0.00 |
We introduce a new solution concept for games, near-strong equilibrium, a variation of strong equilibrium. Previous work has shown the existence of 2-strong pure strategy equilibrium for network creation games with 1 k-strong equilibrium for k ≥ 3 does not exist. In this paper we show that 3-near-strong equilibrium exists, and provide tight bounds on existence of k-near-strong equilibria for k ≥ 4. Then we repeat our analysis for correlated mixed strategies, where we show that, surprisingly, 3-correlated-strong equilibrium exists, and also show bounds for existence of correlated k-strong equilibria. Moreover, the equilibrium profile can be arbitrarily close to the social optimum. For both pure and correlated settings, we show examples where no equilibrium exists. On the conceptual level, our work contributes to the recent literature of extensions of strong equilibrium, while providing positive results for stability against group deviations in one of the basic settings discussed in the algorithmic game theory literature.