Strategyproof facility location for concave cost functions

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2013, Pages 435-452

  Fotakis, Dimitris ^a   Tzamos, Christos ^b  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Algorithmic mechanism design; Facility location games; Social choice

Indexed keywords

ELECTRONIC COMMERCE; GAME THEORY; LOCATION; MACHINE DESIGN;

ALGORITHMIC MECHANISM DESIGN; APPROXIMATION RATIOS; DETERMINISTIC MECHANISM; FACILITY LOCATION GAMES; FACILITY LOCATIONS; INCREASING FUNCTIONS; RANDOMIZED MECHANISM; SOCIAL CHOICE;

COST FUNCTIONS;

EID: 84879756742     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2492002.2482595     Document Type: Conference Paper

References (19)

1. Alon, N., Feldman, M., Procaccia, A., and Tennenholtz, M. 2010. Strategyproof approximation of the minimax on networks. Mathematics of Operations Research 35, 3, 513-526.
2. Barberà, S. 2001. An introduction to strategyproof social choice functions. Social Choice and Welfare 18, 619-653.
3. Dokow, E., Feldman, M., Meir, R., and Nehama, I. 2012. Mechanism design on discrete lines and cycles. In Proc. of the 13th ACM Conference on Electronic Commerce (EC '12), 423-440.
4. Escoffier, B., Gourvés, L., Thang, N., Pascual, F., and Spanjaard, O. 2011. Strategy-proof mecha- nisms for Facility Location games with many facilities. In Proc. of the 2nd International Conference on Algorithmic Decision Theory (ADT '11). LNAI 6992, 67-81.
5. Feldman, M. and Wilf, Y. 2013. Strategyproof Facility Location and the least squares objective In Proc. of the 14th ACM Conference on Electronic Commerce (EC '13). Full version in CoRR abs/1108.1762.
6. Fotakis, D. and Tzamos, C. 2013a. On the power of deterministic mechanisms for Facility Location games. In Proc. of the 40th International Colloquium on Automata, Languages and Programming (ICALP '13). Full version in CoRR abs/1207.0935.
7. Fotakis, D. and Tzamos, C. 2013b. Winner-imposing strategyproof mechanisms for multiple Facility Lo- cation games. Theoretical Computer Science 472, 90-103.
8. Koutsoupias, E. 2011. Scheduling without payments. In Proc. of the 4th International Symposium on Algorithmic Game Theory (SAGT '11). LNCS 6982, 143-153.
9. Lu, P., Sun, X., Wang, Y., and Zhu, Z. 2010. Asymptotically optimal strategyproof mechanisms for two-facility games. In Proc. of the 11th ACM Conference on Electronic Commerce (EC '10), 315-324.
10. Lu, P., Wang, Y., and Zhou, Y. 2009. Tighter bounds for facility games. In Proc. of the 5th Workshop on Internet and Network Economics (WINE '09). LNCS 5929, 137-148.
11. Mirchandani, P. and Francis, R. 1990. Discrete Location Theory. Wiley.
12. Miyagawa, E. 2001. Locating libraries on a street. Social Choice and Welfare 18, 527-541.
13. Moulin, H. 1980. On strategy-proofness and single-peakedness. Public Choice 35, 437-455.
14. Nisan, N., Roughgarden, T., Tardos, E., and Vazirani, V. 2007. Algorithmic Game Theory. Cambridge University Press.
15. Nissim, K., Smorodinsky, R., and Tennenholtz, M. 2012. Approximately optimal mechanism design via Differential Privacy. In Proc. of the 3rd Conference on Innovations in Theoretical Computer Science (ITCS '12), 203-213.
16. Procaccia, A. and Tennenholtz, M. 2009. Approximate mechanism design without money. In Proc. of the 10th ACM Conference on Electronic Commerce (EC '09), 177-186.
17. Schummer, J. and Vohra, R. 2002. Strategyproof location on a network. Journal of Economic Theory 104, 405-428.
18. Sprumont, Y. 1995. Strategyproof collective choice in economic and political environments. The Canadian Journal of Economics 28, 1, 68-108.
19. Sui, X., Boutilier, C., and Sandholm, T. 2012. Analysis and optimization of multi-dimensional percentile mechanisms. In Proc. of 4th International Workshop on Computational Social Choice (COMSOC '12).