Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Simple local search problems that are hard to solve
SIAM Journal on Computing
Integer Linear Programs and Local Search for Max-Cut
SIAM Journal on Computing
Algorithms, games, and the internet
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Market sharing games applied to content distribution in ad-hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
The complexity of pure Nash equilibria
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Machine Learning
Selfish load balancing and atomic congestion games
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Maximizing Quadratic Programs: Extending Grothendieck's Inequality
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
The Price of Routing Unsplittable Flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The price of anarchy of finite congestion games
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Uncoordinated load balancing and congestion games in p2p systems
IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
On the convergence of multicast games in directed networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Fast load balancing via bounded best response
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Better bounds for online load balancing on unrelated machines
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
On Satisfiability Games and the Power of Congestion Games
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Improved equilibria via public service advertising
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Efficient coordination mechanisms for unrelated machine scheduling
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Proceedings of the 10th ACM conference on Electronic commerce
Nash Dynamics in Constant Player and Bounded Jump Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Performances of One-Round Walks in Linear Congestion Games
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Nash Dynamics in Congestion Games with Similar Resources
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
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
Proceedings of the 11th ACM conference on Electronic commerce
Dynamics in network interaction games
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Computing stable outcomes in hedonic games
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
Strategic multiway cut and multicut games
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Leading dynamics to good behavior
ACM SIGecom Exchanges
Flows and Decompositions of Games: Harmonic and Potential Games
Mathematics of Operations Research
Computing stable outcomes in hedonic games with voting-based deviations
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
SIAM Journal on Computing
Multicast transmissions in non-cooperative networks with a limited number of selfish moves
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
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
On the power of nodes of degree four in the local max-cut problem
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
The snowball effect of uncertainty in potential games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
Convergence and approximation in potential games
Theoretical Computer Science
Proceedings of the 13th ACM Conference on Electronic Commerce
The speed of convergence in congestion games under best-response dynamics
ACM Transactions on Algorithms (TALG)
On the impact of fair best response dynamics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Minimizing expectation plus variance
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
A theoretical examination of practical game playing: lookahead search
SAGT'12 Proceedings of the 5th international conference on Algorithmic Game Theory
Near-Potential Games: Geometry and Dynamics
ACM Transactions on Economics and Computation - Special Issue on Algorithmic Game Theory
ACM Transactions on Economics and Computation
| Hi-index | 0.00 |
We study the speed of convergence to approximately optimal states in two classes of potential games. We provide bounds in terms of the number of rounds, where a round consists of a sequence of movements, with each player appearing at least once in each round. We model the sequential interaction between players by a best-response walk in the state graph, where every transition in the walk corresponds to a best response of a player. Our goal is to bound the social value of the states at the end of such walks. In this paper, we focus on two classes of potential games: selfish routing games, and cut games (or party affiliation games [7]).