Characterizing the existence of potential functions in weighted congestion games

DOI10.1007/S00224-011-9315-XzbMATH Open1278.91013OpenAlexW2169988108MaRDI QIDQ647489FDOQ647489

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

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
• A unifying approximate potential for weighted congestion games
• A unifying approximate potential for weighted congestion games

zbMATH Keywords

potential functionspure Nash equilibriaweighted congestion games

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (20)

• Pure Nash Equilibria in Resource Graph Games
• A Selective Tour Through Congestion Games
• Cooperative congestion games: existence of a Nash-stable coalition structure
• Optimal Cost-Sharing in General Resource Selection Games
• A Glimpse at Paul G. Spirakis
• A convergence analysis of the price of anarchy in atomic congestion games
• On the existence of pure Nash equilibria in weighted congestion games
• A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
• The Price of Stability of Weighted Congestion Games
• The Price of Stability of Weighted Congestion Games
• Nash-stable coalition partition and potential functions in games with coalition structure
• Title not available (Why is that?)
• A universal construction generating potential games
• The structure of utility functions ensuring the existence of an exact potential in a strategic game
• The price of anarchy in nonatomic consumption-relevance congestion games
• Congestion models and weighted Bayesian potential games
• Characterizing the existence of potential functions in weighted congestion games
• Cost-Sharing in Generalised Selfish Routing
• Equilibria in Multiclass and Multidimensional Atomic 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)