Network Cost-Sharing without Anonymity

DOI10.1007/978-3-662-44803-8_12zbMath1403.91071OpenAlexW2401057794MaRDI QIDQ2938653

Okke Schrijvers, Tim Roughgarden

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

Shapley valuenetwork cost-sharing gamesnon-anonymous cost functions

Mathematics Subject Classification ID

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

Related Items (7)

Cost-Sharing in Generalised Selfish Routing ⋮ Tight Bounds for Cost-Sharing in Weighted Congestion Games ⋮ Cost-sharing scheduling games on restricted unrelated machines ⋮ Sharing Non-anonymous Costs of Multiple Resources Optimally ⋮ Designing cost-sharing methods for Bayesian games ⋮ A Characterization of Undirected Graphs Admitting Optimal Cost Shares ⋮ On the Price of Anarchy of cost-sharing in real-time scheduling systems

This page was built for publication: Network Cost-Sharing without Anonymity