New local search approximation techniques for maximum generalized satisfiability problems
CIAC '94 Proceedings of the second Italian conference on Algorithms and complexity
On Syntactic versus Computational Views of Approximability
SIAM Journal on Computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Tight bounds for worst-case equilibria
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
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
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the price of anarchy and stability of correlated equilibria of linear congestion games,,
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Price of anarchy, locality gap, and a network service provider game
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
| Hi-index | 0.00 |
We introduce and study a congestion game having MAX SAT as an underlying structure and show that its price of anarchy is 1/2. The main result is a redesign of the game leading to an improved price of anarchy of 2/3 from which we derive a non oblivious local search algorithm for MAX SAT with locality gap 2/3. A similar congestion MIN SAT game is also studied.