Pure Nash equilibria in player-specific and weighted congestion games

DOI10.1016/j.tcs.2008.12.035zbMath1159.91328OpenAlexW1970500571MaRDI QIDQ1014625

Heiko Röglin, Heiner Ackermann, Berthold Vöcking

Publication date: 29 April 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.12.035

zbMATH Keywords

Nash equilibriamatroidscongestion games

Mathematics Subject Classification ID

Noncooperative games (91A10) Special types of economic equilibria (91B52) Games involving graphs (91A43) Applications of game theory (91A80) Queues and service in operations research (90B22)

Related Items

Congestion Games with Complementarities ⋮ Optimal cost sharing for capacitated facility location games ⋮ Uniqueness of equilibria in atomic splittable polymatroid congestion games ⋮ Congestion games with mixed objectives ⋮ On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ Computation of equilibria and the price of anarchy in bottleneck congestion games ⋮ Strong equilibria in games with the lexicographical improvement property ⋮ Equilibrium computation in resource allocation games ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ Social welfare in search games with asymmetric information ⋮ A common generalization of budget games and congestion games ⋮ Congestion Games with Mixed Objectives ⋮ Dynamic club formation with coordination ⋮ Price of Anarchy in Networks with Heterogeneous Latency Functions ⋮ Characterizing the existence of potential functions in weighted congestion games ⋮ On best response dynamics in weighted congestion games with polynomial delays ⋮ Resource buying games ⋮ Network topology and equilibrium existence in weighted network congestion games ⋮ Congestion games with linearly independent paths: convergence time and price of anarchy ⋮ Congestion Games with Variable Demands ⋮ On the Existence of Pure Nash Equilibria in Weighted Congestion Games ⋮ Congestion Games with Multi-Dimensional Demands ⋮ Unnamed Item ⋮ The price of anarchy in nonatomic consumption-relevance congestion games ⋮ Generalizations of weighted matroid congestion games: pure Nash equilibrium, sensitivity analysis, and discrete convex function ⋮ Non-cooperative queueing games on a network of single server queues ⋮ Project games ⋮ Efficiency of Equilibria in Uniform Matroid Congestion Games ⋮ Uniqueness of Equilibria in Atomic Splittable Polymatroid Congestion Games ⋮ Convergence Dynamics of Graphical Congestion Games ⋮ Computing equilibrium in network utility-sharing and discrete election games ⋮ Cooperative congestion games: existence of a Nash-stable coalition structure ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pure Nash equilibria in restricted budget games ⋮ Pure Nash Equilibria in Resource Graph Games

Cites Work

• Unnamed Item
• Unnamed Item
• How easy is local search?
• Computing with truly asynchronous threshold logic networks
• Social optimality and cooperation in nonatomic congestion games.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• The Price of Stability for Network Design with Fair Cost Allocation
• Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
• The complexity of pure Nash equilibria
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Finding minimum congestion spanning trees
• Computing Nash equilibria for scheduling on restricted parallel links