{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:52Z","timestamp":1725570772221},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642175718"},{"type":"electronic","value":"9783642175725"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17572-5_50","type":"book-chapter","created":{"date-parts":[[2010,12,6]],"date-time":"2010-12-06T03:54:45Z","timestamp":1291607685000},"page":"559-562","source":"Crossref","is-referenced-by-count":0,"title":["False-Name-Proofness in Facility Location Problem on the Real Line"],"prefix":"10.1007","author":[{"given":"Taiki","family":"Todo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsushi","family":"Iwasaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","unstructured":"Bachrach, Y., Elkind, E.: Divide and conquer: false-name manipulations in weighted voting games. In: Proceedings of the Seventh International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 975\u2013982 (2008)"},{"key":"50_CR2","unstructured":"Ching, S., Thomson, W.: Population-monotonic solutions in public good economies with single-peaked preferences. RCER Working Papers 362, University of Rochester - Center for Economic Research, RCER (1993)"},{"key":"50_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-540-92185-1_36","volume-title":"Internet and Network Economics","author":"V. Conitzer","year":"2008","unstructured":"Conitzer, V.: Anonymity-proof voting rules. In: Papadimitriou, C., Zhang, S. (eds.) WINE 2008. LNCS, vol.\u00a05385, pp. 295\u2013306. Springer, Heidelberg (2008)"},{"key":"50_CR4","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":"50_CR5","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":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-10841-9_24","volume-title":"Internet and Network Economics","author":"P. Penna","year":"2009","unstructured":"Penna, P., Schoppmann, F., Silvestri, R., Widmayer, P.: Pseudonyms in cost-sharing games. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol.\u00a05929, pp. 256\u2013267. Springer, Heidelberg (2009)"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the Tenth ACM Conference on Electronic Commerce (EC), pp. 177\u2013186 (2009)","DOI":"10.1145\/1566374.1566401"},{"issue":"2","key":"50_CR8","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1006\/jeth.2001.2807","volume":"104","author":"J. Schummer","year":"2004","unstructured":"Schummer, J., Vohra, R.V.: Strategy-proof location on a network. Journal of Economic Theory\u00a0104(2), 405\u2013428 (2004)","journal-title":"Journal of Economic Theory"},{"issue":"2","key":"50_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/S0004-3702(01)00077-7","volume":"130","author":"M. Yokoo","year":"2001","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: Robust combinatorial auction protocol against false-name bids. Artificial Intelligence\u00a0130(2), 167\u2013181 (2001)","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Internet and Network Economics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17572-5_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T14:22:41Z","timestamp":1553264561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17572-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175718","9783642175725"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17572-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}