Author:
Mei Lili,Ye Deshi,Zhang Yong
Funder
National Natural Science Foundation of China
HKU small project funding
shenzhen basic research grant
National High Technology Research and Development Program of China
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference17 articles.
1. Alon N, Feldman M, Procaccia AD, Tennenholtz M (2010) Strategyproof approximation of the minimax on networks. Math Oper Res 35(5):513–526
2. Berman O, Drezner Z (2000) A note on the location of an obnoxious facility on a network. Eur J Oper Res 120(1):215–217
3. Cheng Y, Yu W, Zhang G (2011) Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor Comput Sci 35(3):513–526
4. Dokow E, Feldman M, Meir R, Nehama I (2012) Mechanism design on discrete lines and cycles. In: Proceedings of the 13th ACM conference on electronic commerce (EC), pp 423–440
5. Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40(3):275–291
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献