Cost-sharing mechanisms for network design
From MaRDI portal
Publication:2471805
DOI10.1007/s00453-007-9065-yzbMath1169.68314MaRDI QIDQ2471805
Aravind Srinivasan, Éva Tardos, Anupam Gupta
Publication date: 18 February 2008
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Cost-Sharing_Mechanisms_for_Network_Design/6604541
68M10: Network design and communication in computer systems
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Cross-monotonic cost sharing methods for connected facility location games
- Simpler and better approximation algorithms for network design
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Applications of approximation algorithms to cooperative games
- Strategyproof sharing of submodular costs: budget balance versus efficiency