A Characterization of Undirected Graphs Admitting Optimal Cost Shares

DOI10.1007/978-3-319-71924-5_17zbMath1405.91075arXiv1704.01983OpenAlexW2606024223MaRDI QIDQ4614075

Tobias Harks, Anja Huber, Manuel Surek

Publication date: 30 January 2019

Published in: Web and Internet Economics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1704.01983

zbMATH Keywords

forbidden subgraphsnetwork cost sharing games

Mathematics Subject Classification ID

Applications of graph theory (05C90) 2-person games (91A05) Games involving graphs (91A43) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

Unnamed Item ⋮ Designing cost-sharing methods for Bayesian games ⋮ Designing Networks with Good Equilibria under Uncertainty

This page was built for publication: A Characterization of Undirected Graphs Admitting Optimal Cost Shares