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
Sink Equilibria and Convergence
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
On nash equilibria for a network creation game
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Bottleneck links, variable demand, and the tragedy of the commons
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Network design with weighted players
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Algorithms for pure Nash equilibria in weighted congestion games
Journal of Experimental Algorithmics (JEA)
Convergence time to Nash equilibrium in load balancing
ACM Transactions on Algorithms (TALG)
Fast convergence to nearly optimal solutions in potential games
Proceedings of the 9th ACM conference on Electronic commerce
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Pure Nash equilibria in player-specific and weighted congestion games
Theoretical Computer Science
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
Atomic congestion games among coalitions
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Congestion games with player-specific constants
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
On the existence of pure nash equilibria inweighted congestion games
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Congestion games with variable demands
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
On bidimensional congestion games
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
A routing strategy for non-cooperation wireless multi-hop ad hoc networks
Mobile Information Systems
| Hi-index | 0.00 |
Since the pioneering paper of Rosenthal a lot of work has been done in order to determine classes of games that admit a potential. First, we study the existence of potential functions for weighted congestion games. Let $\mathcal{C}$ be an arbitrary set of locally bounded functions and let $\mathcal{G}(\mathcal{C})$ be the set of weighted congestion games with cost functions in $\mathcal{C}$. We show that every weighted congestion game $G\in\mathcal{G}(\mathcal{C})$ admits an exact potential if and only if C contains only affine functions. We also give a similar characterization for weighted potentials with the difference that here $\mathcal{C}$ consists either of affine functions or of certain exponential functions. We finally extend our characterizations to weighted congestion games with facility-dependent demands and elastic demands, respectively.