{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:03:26Z","timestamp":1743149006250,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030877552"},{"type":"electronic","value":"9783030877569"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87756-9_1","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"3-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Aggregating Preferences Represented by Conditional Preference Networks"],"prefix":"10.1007","author":[{"given":"Abu Mohammad Hammad","family":"Ali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Howard J.","family":"Hamilton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elizabeth","family":"Rayner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandra","family":"Zilles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"1_CR1","unstructured":"Airiau, S., Endriss, U., Grandi, U., Porello, D., Uckelman, J.: Aggregating dependency graphs into voting agendas in multi-issue elections. In: IJCAI (2011)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Bachmaier, C., Brandenburg, F., Glei\u00dfner, A., Hofmeier, A.: On the hardness of maximum rank aggregation problems. J. Discrete Alg. 31, 2\u201313 (2015)","DOI":"10.1016\/j.jda.2014.10.002"},{"key":"1_CR3","unstructured":"Bigot, D., Zanuttini, B., Fargier, H., Mengin, J.: Probabilistic conditional preference networks. arXiv (2013)"},{"key":"1_CR4","unstructured":"Booth, R., Chevaleyre, Y., Lang, J., Mengin, J., Sombattheera, C.: Learning conditionally lexicographic preference relations. In: ECAI, pp. 269\u2013274 (2010)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135\u2013191 (2004)","DOI":"10.1613\/jair.1234"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Brafman, R., Domshlak, C., Shimony, S.: On graphical modeling of preference and importance. J. Artif. Intell. Res. 25, 389\u2013424 (2006)","DOI":"10.1613\/jair.1895"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.: Handbook of Computational Social Choice. Cambridge University Press, Cambridge (2016)","DOI":"10.1017\/CBO9781107446984.002"},{"key":"1_CR8","unstructured":"Conitzer, V., Lang, J., Xia, L.: Hypercubewise preference aggregation in multi-issue domains. In: IJCAI (2011)"},{"key":"1_CR9","unstructured":"Cornelio, C., Grandi, U., Goldsmith, J., Mattei, N., Rossi, F., Venable, K.: Reasoning with PCP-nets in a multi-agent context. In: AAMAS, pp. 969\u2013977 (2015)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Dinu, L., Manea, F.: An efficient approach for the rank aggregation problem. Theor. Comput. Sci. 359(1\u20133), 455\u2013461 (2006)","DOI":"10.1016\/j.tcs.2006.05.024"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: TheWebConf, pp. 613\u2013622. ACM (2001)","DOI":"10.1145\/371920.372165"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., Vee, E.: Comparing partial rankings. SIAM J. Discrete Math. 20(3), 628\u2013648 (2006)","DOI":"10.1137\/05063088X"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Grandi, U., Luo, H., Maudet, N., Rossi, F.: Aggregating CP-nets with unfeasible outcomes. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 366\u2013381. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_28","DOI":"10.1007\/978-3-319-10428-7_28"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Koriche, F., Zanuttini, B.: Learning conditional preference networks. Artif. Intell. 174(11), 685\u2013703 (2010)","DOI":"10.1016\/j.artint.2010.04.019"},{"key":"1_CR15","unstructured":"Lang, J.: Vote and aggregation in combinatorial domains with structured preferences. In: IJCAI, vol. 7, pp. 1366\u20131371 (2007)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Lang, J., Xia, L.: Sequential composition of voting rules in multi-issue domains. Math. Soc. Sci. 57(3), 304\u2013324 (2009)","DOI":"10.1016\/j.mathsocsci.2008.12.010"},{"key":"1_CR17","unstructured":"Li, M., Vo, Q., Kowalczyk, R.: Majority-rule-based preference aggregation on multi-attribute domains with CP-nets. In: AAMAS, pp. 659\u2013666 (2011)"},{"key":"1_CR18","unstructured":"Loreggia, A., Mattei, N., Rossi, F., Venable, K.: A notion of distance between CP-nets. In: AAMAS, pp. 955\u2013963 (2018)"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Lukasiewicz, T., Malizia, E.: Complexity results for preference aggregation over (m) CP-nets: Pareto and majority voting. Artif. Intell. 272, 101\u2013142 (2019)","DOI":"10.1016\/j.artint.2018.12.010"},{"key":"1_CR20","unstructured":"Rossi, F., Venable, K., Walsh, T.: mCP nets: representing and reasoning with preferences of multiple agents. In: AAAI, vol. 4, pp. 729\u2013734 (2004)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Rank aggregation for similar items. In: Proceedings of the 2007 SIAM International Conference on Data Mining, pp. 587\u2013592. SIAM (2007)","DOI":"10.1137\/1.9781611972771.66"},{"key":"1_CR22","unstructured":"Xia, L., Conitzer, V., Lang, J.: Voting on multiattribute domains with cyclic preferential dependencies. In: AAAI, vol. 8, pp. 202\u2013207 (2008)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Xia, L., Lang, J., Ying, M.: Sequential voting rules and multiple elections paradoxes. In: Proceedings of TARK, pp. 279\u2013288 (2007)","DOI":"10.1145\/1324249.1324286"},{"key":"1_CR24","unstructured":"Xia, L., Lang, J., Ying, M.: Strongly decomposable voting rules on multiattribute domains. In: AAAI, vol. 7, pp. 776\u2013781 (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87756-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T22:01:49Z","timestamp":1673647309000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"27 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irit.fr\/ADT2021\/","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":"58","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":"27","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":"47% - 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":"7","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)"}}]}}