On the Existence of Pure Nash Equilibria in Weighted Congestion Games

DOI10.1287/moor.1120.0543zbMath1297.91008OpenAlexW2141753937WikidataQ92407024 ScholiaQ92407024MaRDI QIDQ5891841

Max Klimm, Tobias Harks

Publication date: 21 October 2014

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1120.0543

zbMATH Keywords

cost functionspure Nash equilibriaweighted congestion games

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) Deterministic network models in operations research (90B10) General topics in the theory of algorithms (68W01)

Related Items (39)

A survey of static and dynamic potential games ⋮ On potential equations of finite games ⋮ Cost-Sharing in Generalised Selfish Routing ⋮ Optimal cost sharing for capacitated facility location games ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ Unnamed Item ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses ⋮ Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ Timing matters: online dynamics in broadcast games ⋮ Cost-sharing games with rank-based utilities ⋮ Optimal Cost-Sharing in General Resource Selection Games ⋮ A Unified Framework for Pricing in Nonconvex Resource Allocation Games ⋮ Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost ⋮ The power of one evil secret agent ⋮ Using Temporal Dummy Players in Cost-Sharing Games ⋮ Exact price of anarchy for weighted congestion games with two players ⋮ On approximate pure Nash equilibria in weighted congestion games with polynomial latencies ⋮ Stochastic differential reinsurance games in diffusion approximation models ⋮ Resource buying games ⋮ Strategy optimization for static games based on STP method ⋮ Airport capacity extension, fleet investment, and optimal aircraft scheduling in a multilevel market model: quantifying the costs of imperfect markets ⋮ A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games ⋮ Dynamic resource allocation games ⋮ Congestion Games with Variable Demands ⋮ Congestion Games with Multi-Dimensional Demands ⋮ Unnamed Item ⋮ Cost-sharing games in real-time scheduling systems ⋮ Cost-sharing games in real-time scheduling systems ⋮ Non-cooperative queueing games on a network of single server queues ⋮ Project games ⋮ Dynamic Resource Allocation Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ The Price of Stability of Weighted Congestion Games ⋮ A unifying approximate potential for weighted congestion games ⋮ Equilibria in Multiclass and Multidimensional Atomic Congestion Games ⋮ Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost ⋮ Pure Nash Equilibria in Resource Graph Games

Cites Work

• Characterizing the existence of potential functions in weighted congestion games
• Network design with weighted players
• Strong price of anarchy
• Pure Nash equilibria in player-specific and weighted congestion games
• Potential games
• 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
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Algorithms for pure Nash equilibria in weighted congestion games
• Convergence time to Nash equilibrium in load balancing
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Atomic Congestion Games Among Coalitions
• Intrinsic robustness of the price of anarchy
• Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Users
• Exact Price of Anarchy for Polynomial Congestion Games
• The network equilibrium problem in integers
• Topological Conditions for Uniqueness of Equilibrium in Networks
• The Price of Routing Unsplittable Flow
• Atomic resource sharing in noncooperative networks

This page was built for publication: On the Existence of Pure Nash Equilibria in Weighted Congestion Games