{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T15:02:36Z","timestamp":1786978956883,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319213972","type":"print"},{"value":"9783319213989","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21398-9_4","type":"book-chapter","created":{"date-parts":[[2015,6,23]],"date-time":"2015-06-23T11:12:41Z","timestamp":1435057961000},"page":"45-56","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Strategy-Proof Mechanism for Obnoxious Facility Location on a Line"],"prefix":"10.1007","author":[{"given":"Deshi","family":"Ye","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lili","family":"Mei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,24]]},"reference":[{"issue":"3","key":"4_CR1","first-page":"513","volume":"35","author":"Y Cheng","year":"2011","unstructured":"Cheng, Y., Yu, W., Zhang, G.: Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theoretical Computer Science 35(3), 513\u2013526 (2011)","journal-title":"Theoretical Computer Science"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Feldman, M., Wilf, Y.: Strategyproof facility location and the least squares objective. In: Proceedings of the 14th ACM Conference on Electronic Commerce (EC 2013), pp. 873\u2013890 (2013)","DOI":"10.1145\/2482540.2482543"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-642-31770-5_27","volume-title":"Combinatorial Optimization and Applications","author":"K Ibara","year":"2012","unstructured":"Ibara, K., Nagamochi, H.: Characterizing mechanisms in obnoxious facility game. In: Lin, G. (ed.) COCOA 2012. LNCS, vol. 7402, pp. 301\u2013311. Springer, Heidelberg (2012)"},{"key":"4_CR4","unstructured":"Han, Q., Du, D.: Moneyless strategy-proof mechanism on single-sinked policy domain: characterization and applications, Issue 2012, Part 8. Working paper series (University of New Brunswick, Faculty of Business Administration)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on Electronic Commerce (EC 2009), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.A.: Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM conference on Electronic Eommerce (EC 2010), pp. 315\u2013324 (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-10841-9_14","volume-title":"Internet and Network Economics","author":"P Lu","year":"2009","unstructured":"Lu, P., Wang, Y., Zhou, Y.: Tighter bounds for facility games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 137\u2013148. Springer, Heidelberg (2009)"},{"issue":"5","key":"4_CR8","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Mathematics of Operations Research 35(5), 513\u2013526 (2010)","journal-title":"Mathematics of Operations Research"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Nissim, K., Smorodinsky, R., Tennenholtz, M.: Approximately optimal mechanism design via differential privacy. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (ITCS 2012), pp. 203\u2013213 (2012)","DOI":"10.1145\/2090236.2090254"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: Proceedings of the 13th ACM Conference on Electronic Commerce (EC 2012), pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-39206-1_38","volume-title":"Automata, Languages, and Programming","author":"D Fotakis","year":"2013","unstructured":"Fotakis, D., Tzamos, C.: On the power of deterministic mechanisms for facility location games. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 449\u2013460. Springer, Heidelberg (2013)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-642-17572-5_47","volume-title":"Internet and Network Economics","author":"NK Thang","year":"2010","unstructured":"Thang, N.K.: On (group) strategy-proof mechanisms without payment for facility location games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 531\u2013538. Springer, Heidelberg (2010)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Gibbard, A.: Manipulation of voting schemes: a general result. Econometrica: Journal of the Econometric Society, 587\u2013601 (1973)","DOI":"10.2307\/1914083"},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin, H.: On strategy-proofness and single peakedness. Public Choice 35(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J Schummer","year":"2002","unstructured":"Schummer, J., Vohra, R.V.: Strategy-proof location on a network. Journal of Economic Theory 104(2), 405\u2013428 (2002)","journal-title":"Journal of Economic Theory"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Schummer, J., Vohra, R.V.: Mechanism design without money. In: Algorithmic Game Theory, chap. 10, pp. 243\u2013299, Cambridge (2007)","DOI":"10.1017\/CBO9780511800481.012"},{"issue":"1","key":"4_CR17","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/S0377-2217(98)00237-9","volume":"120","author":"O Berman","year":"2000","unstructured":"Berman, O., Drezner, Z.: A note on the location of an obnoxious facility on a network. European Journal of Operational Research 120(1), 215\u2013217 (2000)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E Erkut","year":"1989","unstructured":"Erkut, E., Neuman, S.: Analytical models for locating undesirable facilities. European Journal of Operational Research 40(3), 275\u2013291 (1989)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2003.11.032","volume":"165","author":"C ReVelle","year":"2005","unstructured":"ReVelle, C., Eiselt, H.: Location analysis: A synthesis and survey. European Journal of Operational Research 165(1), 1\u201319 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"4_CR20","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A Tamir","year":"1991","unstructured":"Tamir, A.: Obnoxious facility location on graphs. SIAM Journal on Discrete Mathematics 4(4), 550\u2013567 (1991)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Fotakis, D., Tzamos, C.: Strategyproof facility location for concave cost functions. In: Proceedings of the 14th ACM Conference on Electronic Commerce (EC 2013), pp. 435\u2013452 (2013)","DOI":"10.1145\/2492002.2482595"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21398-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T21:25:54Z","timestamp":1676928354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21398-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319213972","9783319213989"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21398-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}