scientific article; zbMATH DE number 7376073
From MaRDI portal
Publication:5002835
DOI10.4230/LIPIcs.ICALP.2018.146zbMath1499.68029MaRDI QIDQ5002835
Vittorio Bilò, Cosimo Vinci, Luca Moscardelli
Publication date: 28 July 2021
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Network design and communication in computer systems (68M10) Games involving graphs (91A43) Applications of game theory (91A80) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (3)
Congestion games with priority-based scheduling ⋮ The price of anarchy of affine congestion games with similar strategies ⋮ On the robustness of the approximate price of anarchy in generalized congestion games
Cites Work
- Unnamed Item
- Congestion games with failures
- Tight bounds for selfish and greedy load balancing
- Characterizing the existence of potential functions in weighted congestion games
- Congestion games with malicious players
- Congestion games with load-dependent failures: Identical resources
- Equilibria for networks with malicious users
- Stackelberg strategies for atomic congestion games
- An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
- Improved lower bounds on the price of stability of undirected network design games
- A class of games possessing pure-strategy Nash equilibria
- Selfish unsplittable flows
- Efficiency of Equilibria in Uniform Matroid Congestion Games
- Taxes for linear atomic congestion games
- How bad is selfish routing?
- The Price of Stability for Network Design with Fair Cost Allocation
- On Stackelberg Strategies in Affine Congestion Games
- Algorithms for pure Nash equilibria in weighted congestion games
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
- When selfish meets evil
- Algorithms – ESA 2005
- Equilibrium points in n -person games
- Approximation and Online Algorithms
- The Price of Routing Unsplittable Flow
This page was built for publication:
