Cost-Sharing in Generalised Selfish Routing

DOI10.1007/978-3-319-57586-5_23zbMath1489.91013OpenAlexW2605863518MaRDI QIDQ5283373

Konstantinos Kollias, Grammateia Kotsialou, Martin Gairing

Publication date: 21 July 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_23

Mathematics Subject Classification ID

Games involving graphs (91A43) Potential and congestion games (91A14)

Related Items (2)

Designing cost-sharing methods for Bayesian games ⋮ A Characterization of Undirected Graphs Admitting Optimal Cost Shares

Cites Work

• Worst-case equilibria
• Stackelberg strategies and collusion in network games with splittable flow
• Characterizing the existence of potential functions in weighted congestion games
• Potential games
• Local smoothness and the price of anarchy in splittable congestion games
• A class of games possessing pure-strategy Nash equilibria
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• The effect of collusion in congestion games
• Optimal Cost-Sharing in Weighted Congestion Games
• Network Cost-Sharing without Anonymity
• Sharing Non-anonymous Costs of Multiple Resources Optimally
• Restoring Pure Equilibria to Weighted Congestion Games
• On the Existence of Pure Strategy Nash Equilibria in Integer–Splittable Weighted Congestion Games
• The Impact of Oligopolistic Competition in Networks
• Exact Price of Anarchy for Polynomial Congestion Games
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• Tight Bounds for Cost-Sharing in Weighted Congestion Games
• Cost-Balancing Tolls for Atomic Network Congestion Games
• The price of anarchy of finite congestion games
• Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness
• Atomic Congestion Games Among Coalitions
• Potential, Value, and Consistency
• Intrinsic robustness of the price of anarchy
• Potential Games Are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games
• Price of Stability in Polynomial Congestion Games
• The network equilibrium problem in integers
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• The Price of Routing Unsplittable Flow

This page was built for publication: Cost-Sharing in Generalised Selfish Routing