{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:43Z","timestamp":1740098923941,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319691305"},{"type":"electronic","value":"9783319691312"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69131-2_10","type":"book-chapter","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T09:32:49Z","timestamp":1507109569000},"page":"163-179","source":"Crossref","is-referenced-by-count":3,"title":["Rename and False-Name Manipulations in Discrete Facility Location with Optional Preferences"],"prefix":"10.1007","author":[{"given":"Tomohiro","family":"Ono","sequence":"first","affiliation":[]},{"given":"Taiki","family":"Todo","sequence":"additional","affiliation":[]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,5]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1016\/j.econlet.2013.06.011","volume":"120","author":"N Bu","year":"2013","unstructured":"Bu, N.: Unfolding the mystery of false-name-proofness. Econ. Lett. 120(3), 559\u2013561 (2013)","journal-title":"Econ. Lett."},{"key":"10_CR2","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. 5385, pp. 295\u2013306. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-92185-1_36"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, 4\u20138 June 2012, pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Golomb, I.: On voting and facility location. In: Proceedings of the 2016 ACM Conference on Economics and Computation, EC 2016, Maastricht, The Netherlands, 24\u201328 July 2016, pp. 269\u2013286 (2016)","DOI":"10.1145\/2940716.2940725"},{"key":"10_CR5","unstructured":"Lesca, J., Todo, T., Yokoo, M.: Coexistence of utilitarian efficiency and false-name-proofness in social choice. In: International Conference on Autonomous Agents and Multi-agent Systems, AAMAS 2014, Paris, France, 5\u20139 May 2014, pp. 1201\u20131208 (2014)"},{"issue":"4","key":"10_CR6","doi-asserted-by":"crossref","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":"10_CR7","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. 5929, pp. 256\u2013267. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-10841-9_24"},{"issue":"4","key":"10_CR8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/2542174.2542175","volume":"1","author":"AD Procaccia","year":"2013","unstructured":"Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. ACM Trans. Econ. Comput. 1(4), 18 (2013)","journal-title":"ACM Trans. Econ. Comput."},{"key":"10_CR9","unstructured":"Serafino, P., Ventre, C.: Heterogeneous facility location without money on the line. In: 21st European Conference on Artificial Intelligence, ECAI 2014, 18\u201322 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems PAIS 2014, pp. 807\u2013812 (2014)"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Serafino, P., Ventre, C.: Truthful mechanisms without money for non-utilitarian heterogeneous facility location. In: Proceedings of the 29th AAAI Conference on Artificial Intelligence, 25\u201330 January 2015, Austin, Texas, USA, pp. 1029\u20131035 (2015)","DOI":"10.1609\/aaai.v29i1.9307"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Sonoda, A., Todo, T., Yokoo, M.: False-name-proof locations of two facilities: economic and algorithmic approaches. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12\u201317 February 2016, pp. 615\u2013621 (2016)","DOI":"10.1609\/aaai.v30i1.10029"},{"key":"10_CR12","unstructured":"Todo, T., Conitzer, V.: False-name-proof matching. In: International Conference on Autonomous Agents and Multi-Agent Systems, AAMAS 2013, Saint Paul, MN, USA, 6\u201310 May 2013, pp. 311\u2013318 (2013)"},{"key":"10_CR13","unstructured":"Todo, T., Iwasaki, A., Yokoo, M.: False-name-proof mechanism design without money. In: 10th International Conference on Autonomous Agents and Multiagent Systems AAMAS 2011, Taipei, Taiwan, 2\u20136 May 2011, vol. 1\u20133, pp. 651\u2013658 (2011)"},{"issue":"3","key":"10_CR14","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/s00182-013-0397-3","volume":"43","author":"L Wagman","year":"2014","unstructured":"Wagman, L., Conitzer, V.: False-name-proof voting with costs over two alternatives. Int. J. Game Theor. 43(3), 599\u2013618 (2014)","journal-title":"Int. J. Game Theor."},{"key":"10_CR15","unstructured":"Zou, S., Li, M.: Facility location games with dual preference. In: Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, 4\u20138 May 2015, pp. 615\u2013623 (2015)"}],"container-title":["Lecture Notes in Computer Science","PRIMA 2017: Principles and Practice of Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69131-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T22:48:58Z","timestamp":1659566938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69131-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319691305","9783319691312"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69131-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}