Optimal Efficiency Guarantees for Network Design Mechanisms
From MaRDI portal
Publication:5429287
DOI10.1007/978-3-540-72792-7_35zbMath1136.68337OpenAlexW1497029029MaRDI QIDQ5429287
Tim Roughgarden, Mukund Sundararajan
Publication date: 29 November 2007
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_35
Network design and communication in computer systems (68M10) Applications of game theory (91A80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (11)
Beyond Moulin mechanisms ⋮ From Cost Sharing Mechanisms to Online Selection Problems ⋮ Is Shapley cost sharing optimal? ⋮ Cost-sharing mechanisms for scheduling under general demand settings ⋮ Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems ⋮ Black-box reductions for cost-sharing mechanism design ⋮ Bayes-Nash equilibria of the generalized second-price auction ⋮ Singleton Acyclic Mechanisms and Their Applications to Scheduling Problems ⋮ Group-Strategyproof Cost Sharing for Metric Fault Tolerant Facility Location ⋮ An ascending implementation of the Vickrey-Clarke-Groves mechanism for the licensed shared access ⋮ Unnamed Item
This page was built for publication: Optimal Efficiency Guarantees for Network Design Mechanisms
