{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T09:30:54Z","timestamp":1769419854952,"version":"3.49.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,3]],"date-time":"2017-01-03T00:00:00Z","timestamp":1483401600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61433012"],"award-info":[{"award-number":["61433012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1435215"],"award-info":[{"award-number":["U1435215"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"HKU small project funding","award":["201309176064"],"award-info":[{"award-number":["201309176064"]}]},{"name":"shenzhen basic research grant","award":["JCYJ20160229195940462"],"award-info":[{"award-number":["JCYJ20160229195940462"]}]},{"name":"National High Technology Research and Development Program of China","award":["2014AA01A302"],"award-info":[{"award-number":["2014AA01A302"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671355"],"award-info":[{"award-number":["11671355"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10878-016-0105-x","type":"journal-article","created":{"date-parts":[[2017,1,3]],"date-time":"2017-01-03T04:49:30Z","timestamp":1483418970000},"page":"549-571","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Approximation strategy-proof mechanisms for obnoxious facility location on a line"],"prefix":"10.1007","volume":"36","author":[{"given":"Lili","family":"Mei","sequence":"first","affiliation":[]},{"given":"Deshi","family":"Ye","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,3]]},"reference":[{"issue":"5","key":"105_CR1","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/moor.1100.0457","volume":"35","author":"N Alon","year":"2010","unstructured":"Alon N, Feldman M, Procaccia AD, Tennenholtz M (2010) Strategyproof approximation of the minimax on networks. Math Oper Res 35(5):513\u2013526","journal-title":"Math Oper Res"},{"issue":"1","key":"105_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0377-2217(98)00237-9","volume":"120","author":"O Berman","year":"2000","unstructured":"Berman O, Drezner Z (2000) A note on the location of an obnoxious facility on a network. Eur J Oper Res 120(1):215\u2013217","journal-title":"Eur J Oper Res"},{"issue":"3","key":"105_CR3","first-page":"513","volume":"35","author":"Y Cheng","year":"2011","unstructured":"Cheng Y, Yu W, Zhang G (2011) Strategy-proof approximation mechanisms for an obnoxious facility game on networks. Theor Comput Sci 35(3):513\u2013526","journal-title":"Theor Comput Sci"},{"key":"105_CR4","doi-asserted-by":"crossref","unstructured":"Dokow E, Feldman M, Meir R, Nehama I (2012) Mechanism design on discrete lines and cycles. In: Proceedings of the 13th ACM conference on electronic commerce (EC), pp 423\u2013440","DOI":"10.1145\/2229012.2229045"},{"issue":"3","key":"105_CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0377-2217(89)90420-7","volume":"40","author":"E Erkut","year":"1989","unstructured":"Erkut E, Neuman S (1989) Analytical models for locating undesirable facilities. Eur J Oper Res 40(3):275\u2013291","journal-title":"Eur J Oper Res"},{"key":"105_CR6","doi-asserted-by":"crossref","unstructured":"Feldman M, Wilf Y (2013) Strategyproof facility location and the least squares objective. In: Proceedings of the 14th ACM conference on electronic commerce (EC), pp 873\u2013890","DOI":"10.1145\/2492002.2482543"},{"key":"105_CR7","doi-asserted-by":"crossref","unstructured":"Fotakis D, Tzamos C (2013a) On the power of deterministic mechanisms for facility location games. In: The 40th international colloquium on automata, languages and programming (ICALP), pp 449\u2013460","DOI":"10.1007\/978-3-642-39206-1_38"},{"key":"105_CR8","doi-asserted-by":"crossref","unstructured":"Fotakis D, Tzamos C (2013b) Strategyproof facility location for concave cost functions. In: Proceedings of the 14th ACM conference on electronic commerce (EC), pp 435\u2013452","DOI":"10.1145\/2492002.2482595"},{"key":"105_CR9","doi-asserted-by":"crossref","unstructured":"Ibara K, Nagamochi H (2012) Characterizing mechanisms in obnoxious facility game. In: Proceedings of the 6th annual international conference on combinatorial optimization and applications (COCOA), pp 301\u2013311","DOI":"10.1007\/978-3-642-31770-5_27"},{"key":"105_CR10","doi-asserted-by":"crossref","unstructured":"Lu P, Wang Y, Zhou Y (2009) Tighter bounds for facility games. In: Proceedings of the 5th international workshop on internet and network economics (WINE), pp 137\u2013148","DOI":"10.1007\/978-3-642-10841-9_14"},{"key":"105_CR11","doi-asserted-by":"crossref","unstructured":"Lu P, Sun X, Wang Y, Zhu ZA (2010) Asymptotically optimal strategy-proof mechanisms for two-facility games. In: Proceedings of the 11th ACM conference on Electronic commerce (EC), pp 315\u2013324","DOI":"10.1145\/1807342.1807393"},{"issue":"4","key":"105_CR12","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF00128122","volume":"35","author":"H Moulin","year":"1980","unstructured":"Moulin H (1980) On strategy-proofness and single peakedness. Public Choice 35(4):437\u2013455","journal-title":"Public Choice"},{"key":"105_CR13","doi-asserted-by":"crossref","unstructured":"Procaccia AD, Tennenholtz M (2009) Approximate mechanism design without money. In: Proceedings of the 10th ACM conference on electronic commerce (EC), pp 177\u2013186","DOI":"10.1145\/1566374.1566401"},{"issue":"1","key":"105_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2003.11.032","volume":"165","author":"C ReVelle","year":"2005","unstructured":"ReVelle C, Eiselt H (2005) Location analysis: a synthesis and survey. Eur J Oper Res 165(1):1\u201319","journal-title":"Eur J Oper Res"},{"issue":"2","key":"105_CR15","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J Schummer","year":"2002","unstructured":"Schummer J, Vohra RV (2002) Strategy-proof location on a network. J Econ Theory 104(2):405\u2013428","journal-title":"J Econ Theory"},{"issue":"4","key":"105_CR16","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A Tamir","year":"1991","unstructured":"Tamir A (1991) Obnoxious facility location on graphs. SIAM J Discrete Math 4(4):550\u2013567","journal-title":"SIAM J Discrete Math"},{"key":"105_CR17","doi-asserted-by":"crossref","unstructured":"Thang NK (2010) On (group) strategy-proof mechanisms without payment for facility location games. In: Proceedings of the 6th international conference on internet and network economics (WINE), pp 531\u2013538","DOI":"10.1007\/978-3-642-17572-5_47"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0105-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0105-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0105-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,21]],"date-time":"2018-06-21T08:25:38Z","timestamp":1529569538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0105-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,3]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["105"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0105-x","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,3]]}}}