{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:12Z","timestamp":1773656352015,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030579791","type":"print"},{"value":"9783030579807","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-57980-7_19","type":"book-chapter","created":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T23:04:10Z","timestamp":1599519850000},"page":"291-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Recognizing Single-Peaked Preferences on an Arbitrary Graph: Complexity and Algorithms"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Escoffier","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Spanjaard","sequence":"additional","affiliation":[]},{"given":"Magdal\u00e9na","family":"Tydrichov\u00e1","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,8]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows. Alfred P. Sloan School of Management, Massachusetts Institute of Technology (1988)","DOI":"10.21236\/ADA594171"},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., et al.: Trust-based recommendation systems: an axiomatic approach. In: WWW 2008, pp. 199\u2013208. ACM (2008)","DOI":"10.1145\/1367497.1367525"},{"issue":"4","key":"19_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0167-6377(86)90072-6","volume":"5","author":"J Bartholdi III","year":"1986","unstructured":"Bartholdi III, 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":"19_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1613\/jair.3896","volume":"47","author":"N Betzler","year":"2013","unstructured":"Betzler, N., Slinko, A., Uhlmann, J.: On the computation of fully proportional representation. J. Artif. Intell. Res. 47, 475\u2013519 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"1","key":"19_CR5","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."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1613\/jair.4647","volume":"53","author":"F Brandt","year":"2015","unstructured":"Brandt, F., Brill, M., Hemaspaandra, E., Hemaspaandra, L.A.: Bypassing combinatorial protections: polynomial-time algorithms for single-peaked electorates. J. Artif. Intell. Res. 53, 439\u2013496 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.mathsocsci.2015.11.002","volume":"79","author":"R Bredereck","year":"2016","unstructured":"Bredereck, R., Chen, J., Woeginger, G.J.: Are there any nicely structured preference profiles nearby? Math. Soc. Sci. 79, 61\u201373 (2016)","journal-title":"Math. Soc. Sci."},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"707","DOI":"10.1007\/978-3-642-01507-6_80","volume-title":"Advances in Neural Networks \u2013 ISNN 2009","author":"W Cheng","year":"2009","unstructured":"Cheng, W., H\u00fcllermeier, E.: A new instance-based label ranking approach using the Mallows model. In: Yu, W., He, H., Zhang, N. (eds.) ISNN 2009. LNCS, vol. 5551, pp. 707\u2013716. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01507-6_80"},{"key":"19_CR9","unstructured":"Cl\u00e9men\u00e7on, S., Korba, A., Sibony, E.: Ranking median regression: learning to order through local consensus. In: ALT, pp. 212\u2013245 (2018)"},{"key":"19_CR10","unstructured":"Cornaz, D., Galand, L., Spanjaard, O.: Bounded single-peaked width and proportional representation. In: ECAI, vol. 12, pp. 270\u2013275 (2012)"},{"issue":"4","key":"19_CR11","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0165-4896(82)90020-8","volume":"3","author":"G Demange","year":"1982","unstructured":"Demange, G.: Single-peaked orders on a tree. Math. Soc. Sci. 3(4), 389\u2013396 (1982)","journal-title":"Math. Soc. Sci."},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1006\/jagm.1994.1010","volume":"16","author":"J Doignon","year":"1994","unstructured":"Doignon, J., Falmagne, J.: A polynomial time algorithm for unidimensional unfolding representations. J. Algorithms 16(2), 218\u2013233 (1994)","journal-title":"J. Algorithms"},{"key":"19_CR13","unstructured":"Elkind, E., Lackner, M., Peters, D.: Structured preferences. In: Trends in Computational Social Choice, Chapter 10, pp. 187\u2013207. AI Access (2017)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1613\/jair.5210","volume":"58","author":"G Erd\u00e9lyi","year":"2017","unstructured":"Erd\u00e9lyi, G., Lackner, M., Pfandler, A.: Computational aspects of nearly single-peaked electorates. J. Artif. Intell. Res. 58, 297\u2013337 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.artint.2013.11.004","volume":"207","author":"P Faliszewski","year":"2014","unstructured":"Faliszewski, P., Hemaspaandra, E., Hemaspaandra, L.A.: The complexity of manipulative attacks in nearly single-peaked electorates. Artif. Intell. 207, 69\u201399 (2014)","journal-title":"Artif. Intell."},{"key":"19_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"19_CR17","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":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.jet.2006.04.008","volume":"135","author":"K Nehring","year":"2007","unstructured":"Nehring, K., Puppe, C.: The structure of strategy-proof social choice-Part I: general characterization and possibility results on median spaces. J. Econ. Theory 135(1), 269\u2013305 (2007)","journal-title":"J. Econ. Theory"},{"key":"19_CR19","unstructured":"Pennock, D.M., Horvitz, E., Giles, C.L.: Social choice theory and recommender systems: analysis of the axiomatic foundations of collaborative filtering. In: AAAI\/IAAI, pp. 729\u2013734 (2000)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Peters, D.: Single-peakedness and total unimodularity: new polynomial-time algorithms for multi-winner elections. In: AAAI, pp. 1169\u20131176 (2018)","DOI":"10.1609\/aaai.v32i1.11460"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Peters, D., Elkind, E.: Preferences single-peaked on nice trees. In: AAAI, pp. 594\u2013600 (2016)","DOI":"10.1609\/aaai.v30i1.10049"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Peters, D., Lackner, M.: Preferences single-peaked on a circle. In: AAAI, pp. 649\u2013655 (2017)","DOI":"10.1609\/aaai.v31i1.10615"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Sliwinski, J., Elkind, E.: Preferences single-peaked on a tree: sampling and tree recognition. In: IJCAI, August 2019","DOI":"10.24963\/ijcai.2019\/82"},{"issue":"3","key":"19_CR24","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0165-4896(89)90060-7","volume":"17","author":"MA Trick","year":"1989","unstructured":"Trick, M.A.: Recognizing single-peaked preferences on a tree. Math. Soc. Sci. 17(3), 329\u2013334 (1989)","journal-title":"Math. Soc. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57980-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T04:20:32Z","timestamp":1668658832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57980-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030579791","9783030579807"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57980-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Augsburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-augsburg.de\/de\/fakultaet\/mntf\/math\/prof\/opt\/team\/harks\/sagt2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53","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":"21","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":"40% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}