Network cost-sharing without anonymity

DOI10.1007/978-3-662-44803-8_12MaRDI QIDQ2938653zbMATH OpenOpenAlexFDO

Authors Tim Roughgarden, Okke Schrijvers

Publication date 14 January 2015

Published in Algorithmic Game Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-44803-8_12

zbMATH Keywords

network cost-sharing gamesnon-anonymous cost functionsShapley value

Mathematics Subject Classification ID

Cooperative games (91A12) Games involving graphs (91A43)

Recommendations

• Sharing non-anonymous costs of multiple resources optimally
• On approximate Nash equilibria in network design
• Network design with weighted players
• Optimal cost-sharing in weighted congestion games
• How egalitarian are Nash equilibria in network cost-sharing games?

Cited in

(8)

• Designing cost-sharing methods for Bayesian games
• Sharing non-anonymous costs of multiple resources optimally
• Cost-sharing scheduling games on restricted unrelated machines
• Tight bounds for cost-sharing in weighted congestion games
• Strategic sharing of a costly network
• A Characterization of Undirected Graphs Admitting Optimal Cost Shares
• Cost-sharing in generalised selfish routing
• On the Price of Anarchy of cost-sharing in real-time scheduling systems

This page was built for publication: Network cost-sharing without anonymity

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