Strategy-proof approximation mechanisms for an obnoxious facility game on networks
Authors:
- Yukun ChengYCYukun Cheng
- Wei YuWYWei Yu
- Guochuan ZhangGZGuochuan Zhang
- 1 July 2013
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 497, 154-163
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Asymptotically optimal strategy-proof mechanisms for two-facility games2010
- Approximate mechanism design without money2009
- Tighter Bounds for Facility Games2009
- Introduction to Mechanism Design (for Computer Scientists)2007
- Obnoxious Facility Location on GraphsSIAM Journal on Discrete Mathematics, 1991
- A Linear-Time Algorithm for Maxisum Facility Location on Tree NetworksTransportation Science, 1984
- Locating an Obnoxious Facility on a NetworkTransportation Science, 1978
- Incentives in TeamsEconometrica, 1973
- COUNTERSPECULATION, AUCTIONS, AND COMPETITIVE SEALED TENDERSThe Journal of Finance, 1961