Cost sharing over combinatorial domains : Complement-free cost functions and beyond
From MaRDI portal
Publication:5075756
DOI10.4230/LIPIcs.ESA.2019.20OpenAlexW2979105107MaRDI QIDQ5075756
Georgios Birmpas, Evangelos Markakis, Guido Schäfer
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1910.06384
Cites Work
- Unnamed Item
- Efficient cost-sharing mechanisms for prize-collecting problems
- Beyond Moulin mechanisms
- Hardness results for multicast cost sharing.
- Is Shapley cost sharing optimal?
- Incremental cost sharing: Characterization by coalition strategy-proofness
- Combinatorial auctions with decreasing marginal utilities
- Cost-Sharing Models in Participatory Sensing
- Quantifying inefficiency in cost-sharing mechanisms
- Cost Sharing Methods for Makespan and Completion Time Scheduling
- Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location
- Strategyproof sharing of submodular costs: budget balance versus efficiency