Heterogeneous facility location without money
From MaRDI portal
Publication:290519
DOI10.1016/j.tcs.2016.04.033zbMath1345.90057OpenAlexW2345018925MaRDI QIDQ290519
Carmine Ventre, Paolo Serafino
Publication date: 1 June 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.04.033
Related Items
Strategyproof facility location in perturbation stable instances, Strategyproof mechanisms for \(2\)-facility location games with minimax envy, Tight efficiency lower bounds for strategy-proof mechanisms in two-opposite-facility location game, Approximate mechanism design for distributed facility location, The obnoxious facility location game with dichotomous preferences, Discrete facility location games with different preferences, Facility location games with ordinal preferences, Facility location games with ordinal preferences, Heterogeneous facility location with limited resources, On Discrete Truthful Heterogeneous Two-Facility Location, Constrained heterogeneous two-facility location games with max-variant cost, Obnoxious facility location games with candidate locations, Constrained heterogeneous facility location games with max-variant cost, Facility location games with optional preference, The weighted intruder path covering problem, Multiple facility location games with envy ratio, Multiple facility location games with envy ratio
Cites Work
- Unnamed Item
- Strategy-proof location on a network
- Scheduling without payments
- Winner-imposing strategyproof mechanisms for multiple facility location games
- Optimal collusion-resistant mechanisms with verification
- Combinatorial auctions with verification are tractable
- Approximately optimal mechanism design via differential privacy
- Strategyproof Approximation of the Minimax on Networks
