On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games

DOI10.1007/978-3-662-48433-3_14zbMath1358.91071arXiv1507.02908OpenAlexW3102653315MaRDI QIDQ3449591

Sören Riechers, Maximilian Drees, Alexander Skopalik, Matthias Feldotto

Publication date: 4 November 2015

Published in: Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.02908

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43) (n)-person games, (n>2) (91A06) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games ⋮ A common generalization of budget games and congestion games ⋮ Pure Nash equilibria in restricted budget games

Cites Work

• Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness
• Convergence to approximate Nash equilibria in congestion games
• On the performance of approximate equilibria in congestion games
• Network design with weighted players
• Pure Nash equilibria in player-specific and weighted congestion games
• Scheduling shared continuous resources on many-cores
• Potential games
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• Congestion Games with Variable Demands
• Bounding the Potential Function in Congestion Games and Approximate Pure Nash Equilibria
• Budget-Restricted Utility Games with Ordered Strategic Decisions
• Approximate Pure Nash Equilibria in Weighted Congestion Games
• Exact Price of Anarchy for Polynomial Congestion Games
• On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games
• On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games
• Congestion Games with Player-Specific Constants
• Complexity of Pure Nash Equilibria in Player-Specific Network Congestion Games
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Intrinsic robustness of the price of anarchy
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
• The Price of Routing Unsplittable Flow
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Unnamed Item
• Unnamed Item

This page was built for publication: On Existence and Properties of Approximate Pure Nash Equilibria in Bandwidth Allocation Games