Characterizing the existence of potential functions in weighted congestion games

DOI10.1007/S00224-011-9315-XMaRDI QIDQ647489zbMATH OpenOpenAlexFDO

Authors Tobias Harks, Max Klimm, Rolf H. Möhring

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

zbMATH Keywords

potential functionspure Nash equilibriaweighted congestion games

Mathematics Subject Classification ID

Noncooperative games (91A10) Distributed systems (68M14)

Recommendations

• Characterizing the existence of potential functions in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure Nash equilibria in weighted congestion games

Cites work

• scientific article; zbMATH DE number 1042202 (Why is no real title available?)
• scientific article; zbMATH DE number 2086616 (Why is no real title available?)
• scientific article; zbMATH DE number 3069635 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• Algorithms for pure Nash equilibria in weighted congestion games
• Atomic Congestion Games Among Coalitions
• Atomic Congestion Games: Fast, Myopic and Concurrent
• Atomic resource sharing in noncooperative networks
• Bottleneck links, variable demand, and the tragedy of the commons
• Congestion Games with Player-Specific Constants
• Congestion games with player-specific payoff functions
• Convergence time to Nash equilibrium in load balancing
• Fictitious play property for games with identical interests
• Network design with weighted players
• On nash equilibria for a network creation game
• On the existence of pure Nash equilibria in weighted congestion games
• Potential games
• Pure Nash equilibria in player-specific and weighted congestion games
• Rate control for communication networks: shadow prices, proportional fairness and stability
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Selfish unsplittable flows
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria

Cited in

(20)

• Characterizing the existence of potential functions in weighted congestion games
• A glimpse at Paul G. Spirakis
• Pure Nash Equilibria in Resource Graph Games
• Cost-sharing in generalised selfish routing
• Optimal cost-sharing in general resource selection games
• Uniform mixed equilibria in network congestion games with link failures
• The price of anarchy in nonatomic consumption-relevance congestion games
• A universal construction generating potential games
• A selective tour through congestion games
• Cooperative congestion games: existence of a Nash-stable coalition structure
• On the existence of pure Nash equilibria in weighted congestion games
• A convergence analysis of the price of anarchy in atomic congestion games
• Equilibria in Multiclass and Multidimensional Atomic Congestion Games
• The structure of utility functions ensuring the existence of an exact potential in a strategic game
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
• Congestion models and weighted Bayesian potential games
• Nash-stable coalition partition and potential functions in games with coalition structure
• The price of stability of weighted congestion games
• The price of stability of weighted congestion games
• Congestion games with variable demands

This page was built for publication: Characterizing the existence of potential functions in weighted congestion games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647489)