Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Computing with truly asynchronous threshold logic networks
Theoretical Computer Science
Finding minimum congestion spanning trees
Journal of Experimental Algorithmics (JEA)
The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
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
Computing Nash equilibria for scheduling on restricted parallel links
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
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
On the Impact of Combinatorial Structure on Congestion Games
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Fast and compact: a simple class of congestion games
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Convergence time to Nash equilibria
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On the complexity of pure Nash equilibria in player-specific network congestion games
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
On the complexity of pure-strategy nash equilibria in congestion and local-effect games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
The equilibrium existence problem in finite network congestion games
WINE'06 Proceedings of the Second international conference on Internet and Network Economics
Routing (un-) splittable flow in games with player-specific linear latency functions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Characterizing the Existence of Potential Functions in Weighted 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
Multiagent resource allocation with sharable items: simple protocols and Nash equilibria
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
On the existence of pure nash equilibria inweighted congestion games
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
Optimal cost sharing protocols for scheduling games
Proceedings of the 12th ACM conference on Electronic commerce
Congestion games with variable demands
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Uncoordinated Two-Sided Matching Markets
SIAM Journal on Computing
A game theoretical study of access point association in wireless mesh networks
Computer Communications
Proceedings of the 13th ACM Conference on Electronic Commerce
On the Existence of Pure Nash Equilibria in Weighted Congestion Games
Mathematics of Operations Research
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Optimal Cost Sharing for Resource Selection Games
Mathematics of Operations Research
Altruism in Atomic Congestion Games
ACM Transactions on Economics and Computation
Hi-index | 5.23 |
Unlike standard congestion games, weighted congestion games and congestion games with player-specific delay functions do not necessarily possess pure Nash equilibria. It is known, however, that there exist pure equilibria for both of these variants in the case of singleton congestion games, i.e., if the players' strategy spaces contain only sets of cardinality one. In this paper, we investigate how far such a property on the players' strategy spaces guaranteeing the existence of pure equilibria can be extended. We show that both weighted and player-specific congestion games admit pure equilibria in the case of matroid congestion games, i.e., if the strategy space of each player consists of the bases of a matroid on the set of resources. We also show that the matroid property is the maximal property that guarantees pure equilibria without taking into account how the strategy spaces of different players are interweaved. Additionally, our analysis of player-specific matroid congestion games yields a polynomial time algorithm for computing pure equilibria. We also address questions related to the convergence time of such games. For player-specific matroid congestion games, in which the best response dynamics may cycle, we show that from every state there exists a short sequences of better responses to an equilibrium. For weighted matroid congestion games, we present a superpolynomial lower bound on the convergence time of the best response dynamics showing that players do not even converge in pseudopolynomial time.