Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
The Price of Stability for Network Design with Fair Cost Allocation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Selfish routing with atomic players
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Strong equilibrium in cost sharing connection games
Proceedings of the 8th ACM conference on Electronic commerce
Network formation games with local coalitions
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
The Price of Anarchy on Uniformly Related Machines Revisited
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the Hardness and Existence of Quasi-Strict Equilibria
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Strong and Pareto Price of Anarchy in Congestion Games
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Strong Nash Equilibria in Games with the Lexicographical Improvement Property
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Mediated Equilibria in Load-Balancing Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On Strong Equilibria in the Max Cut Game
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Near-strong equilibria in network creation games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The good, the bad and the cautious: safety level cooperative games
WINE'10 Proceedings of the 6th international conference on Internet and network economics
The max k-cut game and its strong equilibria
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
The price of anarchy on uniformly related machines revisited
Information and Computation
On the impact of local taxes in a set cover game
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Demand allocation games: integrating discrete and continuous strategy spaces
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
Strong price of anarchy for machine load balancing
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
On the verification and computation of strong nash equilibrium
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Approximate strong equilibria in job scheduling games with two uniformly related machines
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.