On the impact of singleton strategies in congestion games

DOI10.4230/LIPICS.ESA.2017.17zbMATH Open1448.91020arXiv2202.12173MaRDI QIDQ5111703FDOQ5111703

Vittorio Bilò, Cosimo Vinci

Publication date: 27 May 2020

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

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

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)

Cites Work

• Equilibrium points in n -person games
• Title not available (Why is that?)
• A class of games possessing pure-strategy Nash equilibria
• Title not available (Why is that?)
• Selfish unsplittable flows
• On the existence of pure Nash equilibria in weighted congestion games
• On the impact of combinatorial structure on congestion games
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Tight bounds for selfish and greedy load balancing
• Pure Nash equilibria in player-specific and weighted congestion games
• On the performance of approximate equilibria in congestion games
• The Price of Routing Unsplittable Flow
• Convergence and approximation in potential games
• Performance of one-round walks in linear congestion games
• Selfish load balancing and atomic congestion games
• Title not available (Why is that?)
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Stackelberg strategies for atomic congestion games
• The price of anarchy for polynomial social cost
• A new model for selfish routing
• Exact Price of Anarchy for Polynomial Congestion Games
• Intrinsic Robustness of the Price of Anarchy
• The Curse of Sequentiality in Routing Games
• Efficiency of Equilibria in Uniform Matroid Congestion Games

Cited In (16)

• Monotonicity of equilibria in nonatomic congestion games
• Using Temporal Dummy Players in Cost-Sharing Games
• A First Step Towards Analyzing the Convergence Time in Player-Specific Singleton Congestion Games
• The Price of Stability of Weighted Congestion Games
• The Price of Stability of Weighted Congestion Games
• Computing Approximate Equilibria in Weighted Congestion Games via Best-Responses
• 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
• Title not available (Why is that?)
• On singleton congestion games with resilience against collusion
• 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

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)