Cost-sharing in generalised selfish routing

DOI10.1007/978-3-319-57586-5_23zbMATH Open1489.91013OpenAlexW2605863518MaRDI QIDQ5283373FDOQ5283373

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

Recommendations

• The price of routing unsplittable flow
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Routing (un-) splittable flow in games with player-specific affine latency functions
• The price of routing unsplittable flow
• The price of selfish routing

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

This page was built for publication: Cost-sharing in generalised selfish routing

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