Characterizing the existence of potential functions in weighted congestion games
From MaRDI portal
Publication:647489
DOI10.1007/s00224-011-9315-xzbMath1278.91013OpenAlexW2169988108MaRDI QIDQ647489
Rolf H. Möhring, Tobias Harks, Max Klimm
Publication date: 23 November 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.980.4013
Related Items (18)
The structure of utility functions ensuring the existence of an exact potential in a strategic game ⋮ Cost-Sharing in Generalised Selfish Routing ⋮ A Glimpse at Paul G. Spirakis ⋮ A Selective Tour Through Congestion Games ⋮ A universal construction generating potential games ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ Unnamed Item ⋮ Nash-stable coalition partition and potential functions in games with coalition structure ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Congestion Games with Variable Demands ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ The Price of Stability of Weighted Congestion Games ⋮ Cooperative congestion games: existence of a Nash-stable coalition structure ⋮ The Price of Stability of Weighted Congestion Games ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pure Nash Equilibria in Resource Graph Games
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network design with weighted players
- Pure Nash equilibria in player-specific and weighted congestion games
- Potential games
- Congestion games with player-specific payoff functions
- Fictitious play property for games with identical interests
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Rate control for communication networks: shadow prices, proportional fairness and stability
- The Price of Stability for Network Design with Fair Cost Allocation
- Algorithms for pure Nash equilibria in weighted congestion games
- Congestion Games with Player-Specific Constants
- Convergence time to Nash equilibrium in load balancing
- The complexity of pure Nash equilibria
- On nash equilibria for a network creation game
- Bottleneck links, variable demand, and the tragedy of the commons
- Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
- Atomic Congestion Games Among Coalitions
- Atomic Congestion Games: Fast, Myopic and Concurrent
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games
- Atomic resource sharing in noncooperative networks
This page was built for publication: Characterizing the existence of potential functions in weighted congestion games
