{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:58Z","timestamp":1759639078031,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319301389"},{"type":"electronic","value":"9783319301396"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-30139-6_23","type":"book-chapter","created":{"date-parts":[[2016,2,19]],"date-time":"2016-02-19T08:35:02Z","timestamp":1455870902000},"page":"286-297","source":"Crossref","is-referenced-by-count":0,"title":["Parameterization of Strategy-Proof Mechanisms in the Obnoxious Facility Game"],"prefix":"10.1007","author":[{"given":"Morito","family":"Oomine","sequence":"first","affiliation":[]},{"given":"Aleksandar","family":"Shurbevski","sequence":"additional","affiliation":[]},{"given":"Hiroshi","family":"Nagamochi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Strategyproof approximation mechanisms for location on networks. arXiv preprint (2009). \n                      arxiv:0907.2049"},{"issue":"1","key":"23_CR2","doi-asserted-by":"publisher","first-page":"153","DOI":"10.2307\/2296962","volume":"50","author":"KC Border","year":"1983","unstructured":"Border, K.C., Jordan, J.S.: Straightforward elections, unanimity and phantom voters. The Rev. Econ. Stud. 50(1), 153\u2013170 (1983)","journal-title":"The Rev. Econ. Stud."},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-38236-9_25","volume-title":"Theory and Applications of Models of Computation","author":"Y Cheng","year":"2013","unstructured":"Cheng, Y., Han, Q., Yu, W., Zhang, G.: Obnoxious facility game with a bounded service range. In: Chan, T.-H.H., Lau, L.C., Trevisan, L. (eds.) TAMC 2013. LNCS, vol. 7876, pp. 272\u2013281. Springer, Heidelberg (2013)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-22616-8_21","volume-title":"Combinatorial Optimization and Applications","author":"Y Cheng","year":"2011","unstructured":"Cheng, Y., Yu, W., Zhang, G.: Mechanisms for obnoxious facility game on a path. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 262\u2013271. Springer, Heidelberg (2011)"},{"key":"23_CR5","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":"23_CR6","unstructured":"Ibara, K., Nagamochi, H.: Characterizing mechanisms in obnoxious facility game. Technical report 2015-006, Department of Applied Mathematics and Physics, Kyoto University (2015). \n                      http:\/\/www.amp.i.kyoto-u.ac.jp\/tecrep\/ps_file\/2015\/2015-005.pdf"},{"key":"23_CR7","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 Commerce (ACM-EC 2010), pp. 315\u2013324. ACM (2010)","DOI":"10.1145\/1807342.1807393"},{"key":"23_CR8","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":"4","key":"23_CR9","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"},{"key":"23_CR10","unstructured":"Oomine, M., Shurbevski, A., Nagamochi, H.: Parameterization of strategy-proof mechanisms in the obnoxious facility game. Technical report 2015-006, Department of Applied Mathematics and Physics, Kyoto University (2015). \n                      http:\/\/www.amp.i.kyoto-u.ac.jp\/tecrep\/ps_file\/2015\/2015-006.pdf"},{"key":"23_CR11","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 (ACM-EC 2009), pp. 177\u2013186. ACM (2009)","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"23_CR12","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. J. Econ. Theory 104(2), 405\u2013428 (2002)","journal-title":"J. Econ. Theory"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30139-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T10:58:10Z","timestamp":1559386690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30139-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319301389","9783319301396"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30139-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}