Cost-sharing in generalised selfish routing

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

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

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 \textit{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 (6)

• Designing cost-sharing methods for Bayesian games
• Cost sharing, capacity investment and pricing in networks
• How to split the costs and charge the travellers sharing a ride? Aligning system's optimum with users' equilibrium
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Selfish transportation games

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)