{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:40:55Z","timestamp":1743054055081,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337919"},{"type":"electronic","value":"9783030337926"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-33792-6_20","type":"book-chapter","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T19:03:55Z","timestamp":1572030235000},"page":"321-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SAT-Based Automated Mechanism Design for False-Name-Proof Facility Location"],"prefix":"10.1007","author":[{"given":"Nodoka","family":"Okada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiki","family":"Todo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yokoo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Albert, M., Conitzer, V., Lopomo, G.: Assessing the robustness of cremer-mclean with automated mechanism design. In: Proceedings of the AAAI 2015, pp. 763\u2013769 (2015)","DOI":"10.1609\/aaai.v29i1.9293"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Albert, M., Conitzer, V., Stone, P.: Automated design of robust mechanisms. In: Proceedings of the AAAI 2017, pp. 298\u2013304 (2017)","DOI":"10.1609\/aaai.v31i1.10574"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.geb.2018.06.010","volume":"112","author":"J Alcalde-Unzu","year":"2018","unstructured":"Alcalde-Unzu, J., Vorsatz, M.: Strategy-proof location of public facilities. Games Econ. Behav. 112, 21\u201348 (2018)","journal-title":"Games Econ. Behav."},{"issue":"3","key":"20_CR4","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.D., Tennenholtz, M.: Strategyproof approximation of the minimax on networks. Math. Oper. Res. 35(3), 513\u2013526 (2010)","journal-title":"Math. Oper. Res."},{"issue":"23","key":"20_CR5","doi-asserted-by":"publisher","first-page":"3432","DOI":"10.1016\/j.disc.2010.08.007","volume":"310","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: Walking in circles. Discrete Math. 310(23), 3432\u20133435 (2010)","journal-title":"Discrete Math."},{"key":"20_CR6","unstructured":"Aziz, H., Paterson, M.: False name manipulations in weighted voting games: splitting, merging and annexation. In: Proceedings of the AAMAS 2009, pp. 409\u2013416 (2009)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-662-54110-4_20","volume-title":"Web and Internet Economics","author":"G Barthe","year":"2016","unstructured":"Barthe, G., Gaboardi, M., Arias, E.J.G., Hsu, J., Roth, A., Strub, P.-Y.: Computer-aided verification for mechanism design. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 279\u2013293. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_20"},{"key":"20_CR8","unstructured":"Brandl, F., Brandt, F., Geist, C., Hofbauer, J.: Strategic abstention based on preference extensions: positive results and computer-generated impossibilities. In: Proceedings of the IJCAI 2015, pp. 18\u201324 (2015)"},{"key":"20_CR9","unstructured":"Brandt, F., Geist, C.: Finding strategyproof social choice functions via SAT solving. In: Proceedings of the AAMAS 2014, pp. 1193\u20131200 (2014)"},{"key":"20_CR10","unstructured":"Brandt, F., Geist, C., Peters, D.: Optimal bounds for the no-show paradox via SAT solving. In: Proceedings of the AAMAS 2016, pp. 314\u2013322 (2016)"},{"key":"20_CR11","unstructured":"Brandt, F., Saile, C., Stricker, C.: Voting with ties: strong impossibilities via SAT solving. In: Proceedings of the AAMAS 2018, pp. 1285\u20131293 (2018)"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","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."},{"issue":"2","key":"20_CR13","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2307\/1911240","volume":"53","author":"J Cr\u00e9mer","year":"1985","unstructured":"Cr\u00e9mer, J., McLean, R.P.: Optimal selling strategies under uncertainty for a discriminating monopolist when demands are interdependent. Econometrica 53(2), 345\u2013361 (1985)","journal-title":"Econometrica"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Dokow, E., Feldman, M., Meir, R., Nehama, I.: Mechanism design on discrete lines and cycles. In: Proceedings of the EC 2012, pp. 423\u2013440 (2012)","DOI":"10.1145\/2229012.2229045"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-24873-3_6","volume-title":"Algorithmic Decision Theory","author":"B Escoffier","year":"2011","unstructured":"Escoffier, B., Gourv\u00e8s, L., Kim Thang, N., Pascual, F., Spanjaard, O.: Strategy-proof mechanisms for facility location games with many facilities. In: Brafman, R.I., Roberts, F.S., Tsouki\u00e0s, A. (eds.) ADT 2011. LNCS (LNAI), vol. 6992, pp. 67\u201381. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24873-3_6"},{"key":"20_CR16","unstructured":"Feigenbaum, I., Sethuraman, J.: Strategyproof mechanisms for one-dimensional hybrid and obnoxious facility location models. In: Proceedings of the AAAI 2015 Workshop on Incentive and Trust in E-Communities, pp. 8\u201313 (2015)"},{"key":"20_CR17","unstructured":"Geist, C., Peters, D.: Computer-aided methods for social choice theory. In: Trends in Computational Social Choice, chap. 13, pp. 249\u2013267 (2017)"},{"key":"20_CR18","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.jmateco.2016.06.005","volume":"66","author":"M Kerber","year":"2016","unstructured":"Kerber, M., Lange, C., Rowat, C.: An introduction to mechanized reasoning. J. Math. Econ. 66, 26\u201339 (2016)","journal-title":"J. Math. Econ."},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.mathsocsci.2016.07.001","volume":"90","author":"A Lahiri","year":"2017","unstructured":"Lahiri, A., Peters, H., Storcken, T.: Strategy-proof location of public bads in a two-country model. Math. Soc. Sci. 90, 150\u2013159 (2017)","journal-title":"Math. Soc. Sci."},{"key":"20_CR20","unstructured":"Lesca, J., Todo, T., Yokoo, M.: Coexistence of utilitarian efficiency and false-name-proofness in social choice. In: Proceedings of the AAMAS 2014, pp. 1201\u20131208 (2014)"},{"issue":"3","key":"20_CR21","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s00182-013-0396-4","volume":"43","author":"V Manjunath","year":"2014","unstructured":"Manjunath, V.: Efficient and strategy-proof social choice when preferences are single-dipped. Int. J. Game Theory 43(3), 579\u2013597 (2014)","journal-title":"Int. J. Game Theory"},{"issue":"4","key":"20_CR22","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":"20_CR23","unstructured":"Narasimhan, H., Agarwal, S., Parkes, D.C.: Automated mechanism design without money via machine learning. In: Proceedings of the IJCAI 2016, pp. 433\u2013439 (2016)"},{"key":"20_CR24","unstructured":"Nehama, I., Todo, T., Yokoo, M.: Manipulations-resistant facility location mechanisms for ZV-line graphs. In: Proceedings of the AAMAS 2019, pp. 1452\u20131460 (2019)"},{"key":"20_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-69131-2_10","volume-title":"PRIMA 2017: Principles and Practice of Multi-Agent Systems","author":"T Ono","year":"2017","unstructured":"Ono, T., Todo, T., Yokoo, M.: Rename and false-name manipulations in discrete facility location with optional preferences. In: An, B., Bazzan, A., Leite, J., Villata, S., van der Torre, L. (eds.) PRIMA 2017. LNCS (LNAI), vol. 10621, pp. 163\u2013179. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69131-2_10"},{"issue":"4","key":"20_CR26","doi-asserted-by":"publisher","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":"20_CR27","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/j.jmateco.2019.06.001","volume":"84","author":"S Roy","year":"2019","unstructured":"Roy, S., Storcken, T.: A characterization of possibility domains in strategic voting. J. Math. Econ. 84, 46\u201355 (2019)","journal-title":"J. Math. Econ."},{"key":"20_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-540-45193-8_2","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T Sandholm","year":"2003","unstructured":"Sandholm, T.: Automated mechanism design: a new application area for search algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 19\u201336. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45193-8_2"},{"issue":"5","key":"20_CR29","doi-asserted-by":"publisher","first-page":"1000","DOI":"10.1287\/opre.2015.1398","volume":"63","author":"T Sandholm","year":"2015","unstructured":"Sandholm, T., Likhodedov, A.: Automated design of revenue-maximizing combinatorial auctions. Oper. Res. 63(5), 1000\u20131025 (2015)","journal-title":"Oper. Res."},{"key":"20_CR30","unstructured":"Shen, W., Tang, P., Zuo, S.: Automated mechanism design via neural networks. In: Proceedings of the AAMAS 2019, pp. 215\u2013223 (2019)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Sonoda, A., Todo, T., Yokoo, M.: False-name-proof locations of two facilities: economic and algorithmic approachess. In: Proceedings of the AAAI 2016, pp. 615\u2013621 (2016)","DOI":"10.1609\/aaai.v30i1.10029"},{"key":"20_CR32","unstructured":"Sui, X., Boutilier, C., Sandholm, T.: Analysis and optimization of multi-dimensional percentile mechanisms. In: Proceedings of the IJCAI 2013, pp. 367\u2013374 (2013)"},{"key":"20_CR33","unstructured":"Todo, T., Conitzer, V.: False-name-proof matching. In: Proceedings of the AAMAS 2013, pp. 311\u2013318 (2013)"},{"key":"20_CR34","unstructured":"Todo, T., Iwasaki, A., Yokoo, M.: False-name-proof mechanism design without money. In: Proceedings of the AAMAS 2011, pp. 651\u2013658 (2011)"},{"key":"20_CR35","unstructured":"Todo, T., Okada, N., Yokoo, M.: False-name-proof facility location on discrete structures (2019). http:\/\/arxiv.org\/abs\/1907.08914"},{"key":"20_CR36","unstructured":"Tsuruta, S., Oka, M., Todo, T., Sakurai, Y., Yokoo, M.: Fairness and false-name manipulations in randomized cake cutting. In: Proceedings of the AAMAS 2015, pp. 909\u2013917 (2015)"},{"issue":"1","key":"20_CR37","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1016\/S0899-8256(03)00045-9","volume":"46","author":"M Yokoo","year":"2004","unstructured":"Yokoo, M., Sakurai, Y., Matsubara, S.: The effect of false-name bids in combinatorial auctions: new fraud in internet auctions. Games Econ. Behav. 46(1), 174\u2013188 (2004)","journal-title":"Games Econ. Behav."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2019: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33792-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T17:23:18Z","timestamp":1664731398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33792-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337919","9783030337926"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33792-6_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2019.di.unito.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"112","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}