On the impact of singleton strategies in congestion games

DOI10.4230/LIPICS.ESA.2017.17MaRDI QIDQ5111703zbMATH OpenFDO

Authors Vittorio Bilò, Cosimo Vinci

Publication date 27 May 2020

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

zbMATH Keywords

Nash equilibriumgreedy algorithmsprice of anarchycongestion gamesonline load balancing

Mathematics Subject Classification ID

Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Recommendations

• Mathematical Foundations of Computer Science 2004
• SOFSEM 2006: Theory and Practice of Computer Science
• scientific article; zbMATH DE number 5823841
• Performance of one-round walks in linear congestion games
• Performances of One-Round Walks in Linear Congestion Games

Cites work

• scientific article; zbMATH DE number 5764829 (Why is no real title available?)
• scientific article; zbMATH DE number 1306871 (Why is no real title available?)
• A class of games possessing pure-strategy Nash equilibria
• A new model for selfish routing
• Convergence and approximation in potential games
• Efficiency of equilibria in uniform matroid congestion games
• Equilibrium points in n -person games
• Exact price of anarchy for polynomial congestion games
• Intrinsic robustness of the price of anarchy
• On the existence of pure Nash equilibria in weighted congestion games
• On the impact of combinatorial structure on congestion games
• On the performance of approximate equilibria in congestion games
• Performance of one-round walks in linear congestion games
• Pure Nash equilibria in player-specific and weighted congestion games
• Selfish load balancing and atomic congestion games
• Selfish unsplittable flows
• Stackelberg strategies for atomic congestion games
• The complexity of pure Nash equilibria
• The curse of sequentiality in routing games
• The price of anarchy for polynomial social cost
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• Tight bounds for selfish and greedy load balancing
• Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
• Worst-case equilibria

Cited in

(20)

• The power of one secret agent
• Monotonicity of equilibria in nonatomic congestion games
• Inefficiency of multiplicative approximate Nash equilibrium for scheduling games
• Using Temporal Dummy Players in Cost-Sharing Games
• A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
• Price of anarchy in paving matroid congestion games
• Price of anarchy for parallel link networks with generalized mean objective
• Inefficiency of pure Nash equilibria in series-parallel network congestion games
• Congestion games with priority-based scheduling
• Cost-sharing games in real-time scheduling systems
• Utility-sharing games: how to improve the efficiency with limited subsidies
• The price of stability of weighted congestion games
• The price of stability of weighted congestion games
• On singleton congestion games with resilience against collusion
• Multi-leader congestion games with an adversary
• On the robustness of the approximate price of anarchy in generalized congestion games
• The power of one evil secret agent
• The price of anarchy of affine congestion games with similar strategies
• Non-atomic one-round walks in congestion games
• Computing approximate equilibria in weighted congestion games via best-responses

This page was built for publication: On the impact of singleton strategies in congestion games

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