{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:51:29Z","timestamp":1743022289035,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_11","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"188-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recovering Single-Crossing Preferences from Approval Ballots"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1708-9376","authenticated-orcid":false,"given":"Andrei","family":"Constantinescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6339-3134","authenticated-orcid":false,"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"key":"11_CR1","unstructured":"Arrow, K.: Social Choice and Individual Values. John Wiley and Sons, Hoboken (1951)"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.geb.2011.02.004","volume":"73","author":"S Barber\u00e0","year":"2011","unstructured":"Barber\u00e0, S., Moreno, B.: Top monotonicity: a common root for single peakedness, single crossing and the median voter result. Games Econ. Behav. 73, 345\u2013359 (2011)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J Bartholdi","year":"1986","unstructured":"Bartholdi, J., Trick, M.A.: Stable matching with preferences derived from a psychological model. Oper. Res. Lett. 5(4), 165\u2013169 (1986)","journal-title":"Oper. Res. Lett."},{"key":"11_CR4","unstructured":"Beresnev, V.L., Davydov, A.I.: On matrices with connectedness property. Upravlyaemye Sistemy 19 (1979). in Russian"},{"issue":"1","key":"11_CR5","first-page":"475","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. Artif. Int. Res. 47(1), 475\u2013519 (2013)","journal-title":"J. Artif. Int. Res."},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1086\/256633","volume":"56","author":"D Black","year":"1948","unstructured":"Black, D.: On the rationale of group decision-making. J. Polit. Econ. 56(1), 23\u201334 (1948)","journal-title":"J. Polit. Econ."},{"issue":"3","key":"11_CR7","first-page":"335","volume":"13","author":"KS Booth","year":"1976","unstructured":"Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. JCSS 13(3), 335\u2013379 (1976)","journal-title":"JCSS"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.): Handbook of Computational Social Choice, 1st edn. Cambridge University Press, USA (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"issue":"4","key":"11_CR9","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00355-012-0717-8","volume":"41","author":"R Bredereck","year":"2013","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: A characterization of the single-crossing domain. Soc. Choice Welf. 41(4), 989\u2013998 (2013)","journal-title":"Soc. Choice Welf."},{"key":"11_CR10","unstructured":"Busing, F.M.T.A.: Advances in multidimensional unfolding. Ph.D. thesis (2010)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Chen, J., Hatschka, C., Simola, S.: Efficient algorithms for monroe and cc rules in multi-winner elections with (nearly) structured preferences. In: ECAI\u201923, pp. 397\u2013404 (2023)","DOI":"10.3233\/FAIA230296"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Constantinescu, A., Wattenhofer, R.: Recovering single-crossing preferences from approval ballots. arXiv:2310.03736 (2023)","DOI":"10.1007\/978-3-031-48974-7_11"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Constantinescu, A.C., Elkind, E.: Proportional representation under single-crossing preferences revisited. In: AAAI\u201921, vol. 35, no. 6, pp. 5286\u20135293 (2021)","DOI":"10.1609\/aaai.v35i6.16667"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Doignon, J.P., Falmagne, J.C.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","DOI":"10.1006\/jagm.1994.1010"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-662-44803-8_13","volume-title":"Algorithmic Game Theory","author":"E Elkind","year":"2014","unstructured":"Elkind, E., Faliszewski, P.: Recognizing 1-Euclidean preferences: an alternative approach. In: Lavi, R. (ed.) SAGT 2014. LNCS, vol. 8768, pp. 146\u2013157. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44803-8_13"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Lackner, M., Obraztsova, S.: The complexity of recognizing incomplete single-crossing preferences. In: AAAI\u201915, vol. 29, no. 1, February 2015","DOI":"10.1609\/aaai.v29i1.9321"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Elkind, E., Faliszewski, P., Slinko, A.: Clone structures in voters\u2019 preferences. In: Proceedings of the ACM Conference on Electronic Commerce, pp. 496\u2013513 (2012)","DOI":"10.1145\/2229012.2229050"},{"key":"11_CR18","unstructured":"Elkind, E., Lackner, M.: Structure in dichotomous preferences. In: IJCAI\u201915, pp. 2019\u20132025 (2015)"},{"key":"11_CR19","unstructured":"Elkind, E., Lackner, M., Peters, D.: Preference restrictions in computational social choice: a survey (2022)"},{"key":"11_CR20","unstructured":"Escoffier, B., Lang, J., \u00d6zt\u00fcrk, M.: Single-peaked consistency and its complexity, pp. 366\u2013370. IOS Press, NLD (2008)"},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A., Rothe, J.: The shield that never was: societies with single-peaked preferences are more open to manipulation and control. In: TARK\u201909, pp. 118\u2013127. ACM, New York, NY, USA (2009)","DOI":"10.1145\/1562814.1562832"},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"Fitzsimmons, Z.: Single-peaked consistency for weak orders is easy. In: Ramanujam, R. (ed.) TARK\u201915, vol. 215, pp. 127\u2013140 (2016)","DOI":"10.4204\/EPTCS.215.10"},{"key":"11_CR23","unstructured":"Guttmann, W., Maucher, M.: Variations on an ordering theme with constraints. In: IFIP TCS (2006)"},{"issue":"1","key":"11_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-218X(94)00054-H","volume":"60","author":"B Klinz","year":"1995","unstructured":"Klinz, B., Rudolf, R., Woeginger, G.J.: Permuting matrices to avoid forbidden submatrices. Discret. Appl. Math. 60(1), 223\u2013248 (1995)","journal-title":"Discret. Appl. Math."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Knoblauch, V.: Recognizing one-dimensional Euclidean preference profiles. J. Math. Econ. 46, 1\u20135 (2010)","DOI":"10.1016\/j.jmateco.2009.05.007"},{"key":"11_CR26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-09016-5","volume-title":"Multi-Winner Voting with Approval Preferences","author":"M Lackner","year":"2023","unstructured":"Lackner, M., Skowron, P.: Multi-Winner Voting with Approval Preferences. Springer International Publishing, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-09016-5"},{"key":"11_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02839-7","volume-title":"Handbook on Approval Voting","year":"2010","unstructured":"Laslier, J.F., Sanver, M.R. (eds.): Handbook on Approval Voting. Springer, Berlin, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-02839-7"},{"key":"11_CR28","unstructured":"Lu, T., Boutilier, C.: Budgeted social choice: from consensus to personalized decision making. In: IJCAI\u201911, pp. 280\u2013286, January 2011"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Magiera, K., Faliszewski, P.: Recognizing top-monotonic preference profiles in polynomial time. In: IJCAI\u201917, pp. 324\u2013330 (2017)","DOI":"10.24963\/ijcai.2017\/46"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: Preflib: a library for preferences http:\/\/www.preflib.org. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 259\u2013270. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41575-3_20"},{"issue":"2","key":"11_CR31","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2307\/2296779","volume":"38","author":"J Mirrlees","year":"1971","unstructured":"Mirrlees, J.: An exploration in the theory of optimum income taxation. Rev. Econ. Stud. 38(2), 175\u2013208 (1971)","journal-title":"Rev. Econ. Stud."},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Peters, D.: Recognising multidimensional Euclidean preferences. In: AAAI\u201917, pp. 642\u2013648 (2017)","DOI":"10.1609\/aaai.v31i1.10616"},{"key":"11_CR33","doi-asserted-by":"publisher","unstructured":"Pierczy\u0144ski, G., Skowron, P.: Core-stable committees under restricted domains. In: Hansen, K.A., Liu, T.X., Malekian, A. (eds.) Web and Internet Economics. WINE 2022. LNCS, vol. 13778, pp. 311\u2013329. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22832-2_18","DOI":"10.1007\/978-3-031-22832-2_18"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Procaccia, A., Rosenschein, J., Zohar, A.: On the complexity of achieving proportional representation. Soc. Choice Welf. 30, 353\u2013362 (2008)","DOI":"10.1007\/s00355-007-0235-2"},{"issue":"3","key":"11_CR35","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0047-2727(77)90005-6","volume":"8","author":"K Roberts","year":"1977","unstructured":"Roberts, K.: Voting over income tax schedules. J. Public Econ. 8(3), 329\u2013340 (1977)","journal-title":"J. Public Econ."},{"key":"11_CR36","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2014.12.012","volume":"569","author":"P Skowron","year":"2015","unstructured":"Skowron, P., Yu, L., Faliszewski, P., Elkind, E.: The complexity of fully proportional representation for single-crossing electorates. Theor. Comput. Sci. 569, 43\u201357 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Sornat, K., Williams, V.V., Xu, Y.: Near-tight algorithms for the Chamberlin-courant and Thiele voting rules. In: De\u00a0Raedt, L. (ed.) IJCAI\u201922, pp. 482\u2013488 (2022)","DOI":"10.24963\/ijcai.2022\/69"},{"key":"11_CR38","unstructured":"Terzopoulou, Z., Karpov, A., Obraztsova, S.: Restricted domains of dichotomous preferences with possibly incomplete information, pp. 2023\u20132025. AAMAS\u201920 (2020)"}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48974-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T02:03:44Z","timestamp":1703988224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","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":"221","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":"37","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":"0","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":"17% - 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","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":"8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}