{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:29Z","timestamp":1759637549130,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642382352"},{"type":"electronic","value":"9783642382369"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38236-9_25","type":"book-chapter","created":{"date-parts":[[2013,4,15]],"date-time":"2013-04-15T02:38:02Z","timestamp":1365993482000},"page":"272-281","source":"Crossref","is-referenced-by-count":4,"title":["Obnoxious Facility Game with a Bounded Service Range"],"prefix":"10.1007","author":[{"given":"Yukun","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Qiaoming","family":"Han","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Guochuan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Alon, N., Feldman, M., Procaccia, A., Tennenholtz, M.: Strategyproof Approximation Mechanisms for Location on Networks, Computing Research Repository-CORR, abs\/0907.2049 (2009)"},{"key":"25_CR2","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., Tennenholtz, M.: Strategyproof Approximation of the Minimax on Networks. Mathematics of Operations Research\u00a035, 513\u2013526 (2010)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Cheng, Y., Yu, W., Zhang, G.: Strategy-proof Approximation Mechanisms for an Obnoxious Facility Game on Networks. Theoretical Computer Science (2011), doi: 10.1016\/j.tcs.2011.11.041","DOI":"10.1016\/j.tcs.2011.11.041"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-24873-3_6","volume-title":"2nd International Conference of Algorithmic Decision Theory (ADT)","author":"B. Escoffier","year":"2011","unstructured":"Escoffier, B., Gourv\u00e8s, L., Thang, N.K., Pascual, F., Spanjaard, O.: Strategy-Proof Mechanisms for Facility Location Games with Many Facilities. In: Brafman, R. (ed.) ADT 2011. LNCS, vol.\u00a06992, pp. 67\u201381. Springer, Heidelberg (2011)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-17572-5_19","volume-title":"Internet and Network Economics","author":"D. Fotakis","year":"2010","unstructured":"Fotakis, D., Tzamos, C.: Winner-imposing Strategyproof Mechanisms for Multiple Facility Location Games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol.\u00a06484, pp. 234\u2013245. Springer, Heidelberg (2010)"},{"key":"25_CR6","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.\u00a07402, pp. 301\u2013311. Springer, Heidelberg (2012)"},{"key":"25_CR7","unstructured":"Han, Q., Du, D.: Moneyless Strategy-proof Mechanism on Single-sinked Policy Domain: Characerization and Applications (2012) (working paper)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/1807342.1807393","volume-title":"11th ACM Conference on Electronic Commerce","author":"P. Lu","year":"2010","unstructured":"Lu, P., Sun, X., Wang, Y., Zhu, Z.: Asymptotically Optimal Strategy-proof Mechanisms for Two-facility Games. In: 11th ACM Conference on Electronic Commerce, pp. 315\u2013324. ACM, New York (2010)"},{"key":"25_CR9","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.\u00a05929, pp. 137\u2013148. Springer, Heidelberg (2009)"},{"issue":"4","key":"25_CR10","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\u00a035(4), 437\u2013455 (1980)","journal-title":"Public Choice"},{"key":"25_CR11","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/1566374.1566401","volume-title":"10th ACM Conference on Electronic Commerce (ACM-EC)","author":"A. Procaccia","year":"2009","unstructured":"Procaccia, A., Tennenholtz, M.: Approximate mechanism design without money. In: 10th ACM Conference on Electronic Commerce (ACM-EC), pp. 177\u2013186. ACM, New York (2009)"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Schummer, J., Vohra, R.V.: Mechanism design without money. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (eds.) Algorithmic Game Theory, ch. 10. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.012"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38236-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T22:09:35Z","timestamp":1715206175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38236-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642382352","9783642382369"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38236-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}