Cost-sharing in generalised selfish routing

DOI10.1007/978-3-319-57586-5_23MaRDI QIDQ5283373zbMATH OpenOpenAlexFDO

Authors Martin Gairing, Konstantinos Kollias, Grammateia Kotsialou

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

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

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

Cites work

• A class of games possessing pure-strategy Nash equilibria
• Atomic Congestion Games Among Coalitions
• Characterizing the existence of potential functions in weighted congestion games
• Cost-balancing tolls for atomic network congestion games
• Exact price of anarchy for polynomial congestion games
• How bad is selfish routing?
• Intrinsic robustness of the price of anarchy
• Local smoothness and the price of anarchy in splittable congestion games
• Network cost-sharing without anonymity
• On the existence of pure Nash equilibria in weighted congestion games
• On the existence of pure strategy Nash equilibria in integer-splittable weighted congestion games
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Optimal cost-sharing in weighted congestion games
• Potential games
• Potential games are \textit{necessary} to ensure pure Nash equilibria in cost sharing games
• Potential, Value, and Consistency
• Price of stability in polynomial congestion games
• Restoring Pure Equilibria to Weighted Congestion Games
• Sharing non-anonymous costs of multiple resources optimally
• Stackelberg strategies and collusion in network games with splittable flow
• The effect of collusion in congestion games
• The impact of oligopolistic competition in networks
• The network equilibrium problem in integers
• The price of anarchy of finite congestion games
• The price of routing unsplittable flow
• The Price of Stability for Network Design with Fair Cost Allocation
• Tight bounds for cost-sharing in weighted congestion games
• Weighted congestion games: price of anarchy, universal worst-case examples, and tightness
• Worst-case equilibria

Cited in

(6)

• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Designing cost-sharing methods for Bayesian games
• How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium
• Selfish transportation games
• Cost sharing, capacity investment and pricing in networks
• 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)