Strategy-proof mechanisms for obnoxious facility game with bounded service range

[1]  Guochuan Zhang,et al.  Facility location games with distinct desires , 2019, Discret. Appl. Math..

[2]  Deshi Ye,et al.  Approximation strategy-proof mechanisms for obnoxious facility location on a line , 2018, J. Comb. Optim..

[3]  Yicheng Xu,et al.  Approximate efficiency and strategy-proofness for moneyless mechanisms on single-dipped policy domain , 2018, J. Glob. Optim..

[4]  Minming Li,et al.  Facility Location Games with Dual Preference , 2015, AAMAS.

[5]  Jay Sethuraman,et al.  Strategyproof Mechanisms for One-Dimensional Hybrid and Obnoxious Facility Location Models , 2014, AAAI Workshop: Incentive and Trust in E-Communities.

[6]  Yukun Cheng,et al.  Strategy-proof approximation mechanisms for an obnoxious facility game on networks , 2013, Theor. Comput. Sci..

[7]  Hiroshi Nagamochi,et al.  Characterizing Mechanisms in Obnoxious Facility Game , 2012, COCOA.

[8]  Olivier Spanjaard,et al.  Strategy-Proof Mechanisms for Facility Location Games with Many Facilities , 2011, ADT.

[9]  Christos Tzamos,et al.  Winner-imposing strategyproof mechanisms for multiple Facility Location games , 2010, Theor. Comput. Sci..

[10]  Noga Alon,et al.  Strategyproof Approximation of the Minimax on Networks , 2010, Math. Oper. Res..

[11]  Zeyuan Allen Zhu,et al.  Asymptotically optimal strategy-proof mechanisms for two-facility games , 2010, EC '10.

[12]  Yuan Zhou,et al.  Tighter Bounds for Facility Games , 2009, WINE.

[13]  Noga Alon,et al.  Strategyproof Approximation Mechanisms for Location on Networks , 2009, ArXiv.

[14]  Moshe Tennenholtz,et al.  Approximate mechanism design without money , 2009, EC '09.

[15]  M. Satterthwaite,et al.  Strategy-proofness and single-peakedness , 1976 .

[16]  S. Boicheva.  Mechanism Design without Money , 2012 .