Finding minimum congestion spanning trees
Journal of Experimental Algorithmics (JEA)
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
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
Network uncertainty in selfish routing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
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
Congestion games with load-dependent failures: identical resources
Proceedings of the 8th ACM conference on Electronic commerce
Uncoordinated two-sided matching markets
Proceedings of the 9th ACM conference on Electronic commerce
On the impact of combinatorial structure on congestion games
Journal of the ACM (JACM)
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Subjective vs. Objective Reality -- The Risk of Running Late
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the complexity of nash dynamics and sink equilibria
Proceedings of the 10th ACM conference on Electronic commerce
Games with Congestion-Averse Utilities
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
A unified approach to congestion games and two-sided markets
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
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
A game theoretic analysis of network design with socially-aware users
Computer Networks: The International Journal of Computer and Telecommunications Networking
Routing (un-) splittable flow in games with player-specific affine latency functions
ACM Transactions on Algorithms (TALG)
The robust price of anarchy of altruistic games
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
A first step towards analyzing the convergence time in player-specific singleton congestion games
SAGA'07 Proceedings of the 4th international conference on Stochastic Algorithms: foundations and applications
Hi-index | 0.01 |
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. In the case of player-specific congestion games, our analysis of matroid games also yields a polynomial time algorithm for computing pure equilibria.