Facility location games with distinct desires
Authors:
- Lili MeiLMLili Mei
- Minming LiMLMinming Li
- Deshi YeDYDeshi Ye
- Guochuan ZhangGZGuochuan Zhang
- 1 July 2019
- journal article
- conference paper
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 264, 148-160
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (11771365, 11671355, 11531014)
This publication has 8 references indexed in Scilit:
- Facility location with double-peaked preferencesAutonomous Agents and Multi-Agent Systems, 2017
- Strategyproof Facility Location for Concave Cost FunctionsAlgorithmica, 2015
- On the Power of Deterministic Mechanisms for Facility Location GamesACM Transactions on Economics and Computation, 2014
- Strategy-proof approximation mechanisms for an obnoxious facility game on networksTheoretical Computer Science, 2013
- Strategyproof Approximation of the Minimax on NetworksMathematics of Operations Research, 2010
- Strategy-proof Location on a NetworkJournal of Economic Theory, 2002
- On strategy-proofness and single peakednessPublic Choice, 1980
- Locating an Obnoxious Facility on a NetworkTransportation Science, 1978