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
Computing with truly asynchronous threshold logic networks
Theoretical Computer Science
Finding minimum congestion spanning trees
Journal of Experimental Algorithmics (JEA)
Near-optimal network design with selfish agents
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Internet indirection infrastructure
IEEE/ACM Transactions on Networking (TON)
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
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
Fairness and optimality in congestion games
Proceedings of the 6th ACM conference on Electronic commerce
Approximation algorithms for distributed and selfish agents
Approximation algorithms for distributed and selfish agents
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Pure nash equilibria in player-specific and weighted congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Concurrent imitation dynamics in congestion games
Proceedings of the 28th ACM symposium on Principles of distributed computing
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
The Impact of Social Ignorance on Weighted Congestion Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Dynamics in network interaction games
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Local search: simple, successful, but sometimes sluggish
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Computing pure Nash and strong equilibria in bottleneck congestion games
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
On the complexity of pareto-optimal nash and strong equilibria
SAGT'10 Proceedings of the Third international conference on Algorithmic game theory
The complexity of equilibria in cost sharing 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
Settling the complexity of local max-cut (almost) completely
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Distributed selfish load balancing on networks
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
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 complexity of approximate nash equilibrium in congestion games with negative delays
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
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)
Dynamics of profit-sharing games
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
On the impact of fair best response dynamics
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
On a noncooperative model for wavelength assignment in multifiber optical networks
IEEE/ACM Transactions on Networking (TON)
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Congestion games with capacitated resources
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
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
| Hi-index | 0.01 |
We study the impact of combinatorial structure in congestion games on the complexity of computing pure Nash equilibria and the convergence time of best response sequences. In particular, we investigate which properties of the strategy spaces of individual players ensure a polynomial convergence time. We show that if the strategy space of each player consists of the bases of a matroid over the set of resources, then the lengths of all best response sequences are polynomially bounded in the number of players and resources. We also prove that this result is tight, that is, the matroid property is a necessary and sufficient condition on the players' strategy spaces for guaranteeing polynomial-time convergence to a Nash equilibrium. In addition, we present an approach that enables us to devise hardness proofs for various kinds of combinatorial games, including first results about the hardness of market sharing games and congestion games for overlay network design. Our approach also yields a short proof for the PLS-completeness of network congestion games. In particular, we show that network congestion games are PLS-complete for directed and undirected networks even in case of linear latency functions.