{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:19:38Z","timestamp":1743081578858,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"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_5","type":"book-chapter","created":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:40Z","timestamp":1635289540000},"page":"71-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Elicitation of Preferences: Optimist or Pessimist?"],"prefix":"10.1007","author":[{"given":"Lo\u00efc","family":"Adam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Destercke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,27]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Benabbou, N., Gonzales, C., Perny, P., Viappiani, P.: Minimax regret approaches for preference elicitation with rank-dependent aggregators. EURO J. Decis. Processes, 29\u201364 (2015). https:\/\/doi.org\/10.1007\/s40070-015-0040-6","DOI":"10.1007\/s40070-015-0040-6"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Benabbou, N., Perny, P., Viappiani, P.: Incremental elicitation of choquet capacities for multicriteria choice, ranking and sorting problems. Artif. Intell. 246, 152\u2013180 (2017)","DOI":"10.1016\/j.artint.2017.02.001"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bourdache, N., Perny, P.: Anytime algorithms for adaptive robust optimization with OWA and WOWA. In: Rothe, J. (ed.) ADT 2017. LNCS, vol. 10576, pp. 93\u2013107. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67504-6_7","DOI":"10.1007\/978-3-319-67504-6_7"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Boutilier, C.: Computational decision support: regret-based models for optimization and preference elicitation. In: Comparative Decision Making: Analysis and Support Across Disciplines and Applications, pp. 423\u2013453 (2013)","DOI":"10.1093\/acprof:oso\/9780199856800.003.0041"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8\u20139), 686\u2013713 (2006)","DOI":"10.1016\/j.artint.2006.02.003"},{"key":"5_CR6","unstructured":"Cabannnes, V., Rudi, A., Bach, F.: Structured prediction with partial labelling through the infimum loss. In: International Conference on Machine Learning, pp. 1230\u20131239. PMLR (2020)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Choquet, G.: Theory of capacities. In: Annales de l\u2019institut Fourier, vol. 5, pp. 131\u2013295 (1954)","DOI":"10.5802\/aif.53"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Ciomek, K., Kadzi\u0144ski, M., Tervonen, T.: Heuristics for prioritizing pair-wise elicitation questions with additive multi-attribute value models. Omega 71, 27\u201345 (2017)","DOI":"10.1016\/j.omega.2016.08.012"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Grabisch, M.: The application of fuzzy integrals in multicriteria decision making. Eur. J. Oper. Res. 89(3), 445\u2013456 (1996)","DOI":"10.1016\/0377-2217(95)00176-X"},{"key":"5_CR10","doi-asserted-by":"publisher","unstructured":"Guillot, P.L., Destercke, S.: Preference elicitation with uncertainty: extending regret based methods with belief functions. In: Ben Amor, N., Quost, B., Theobald, M. (eds.) SUM 2019. LNCS, vol. 11940, pp. 289\u2013309. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35514-2_22","DOI":"10.1007\/978-3-030-35514-2_22"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Holloway, H.A., White Iii, C.C.: Question selection for multi-attribute decision-aiding. Eur. J. Oper. Res. 148(3), 525\u2013533 (2003)","DOI":"10.1016\/S0377-2217(02)00436-8"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"H\u00fcllermeier, E., Destercke, S., Couso, I.: Learning from imprecise data: adjustments of optimistic and pessimistic variants. In: Ben Amor, N., , B., Theobald, M. (eds.) SUM 2019. LNCS, vol. 11940, pp. 266\u2013279. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35514-2_20","DOI":"10.1007\/978-3-030-35514-2_20"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Maron, O., Moore, A.W.: The racing algorithm: model selection for lazy learners. Artif. Intell. Rev. 11(1), 193\u2013225 (1997)","DOI":"10.1007\/978-94-017-2053-3_8"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Savage, L.J.: The theory of statistical decision. J. Am. Stat. Assoc. 46(253), 55\u201367 (1951)","DOI":"10.1080\/01621459.1951.10500768"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Tornede, A., Wever, M., H\u00fcllermeier, E.: Extreme algorithm selection with dyadic feature representation. In: Appice, A., Tsoumakas, G., Manolopoulos, Y., Matwin, S. (eds.) DS 2020. LNCS, vol. 12323, pp. 309\u2013324. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61527-7_21","DOI":"10.1007\/978-3-030-61527-7_21"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Troffaes, M.C.: Decision making under uncertainty using imprecise probabilities. Int. J. Approx. Reason. 45(1), 17\u201329 (2007)","DOI":"10.1016\/j.ijar.2006.06.001"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Yager, R.R.: On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Trans. Syst. Man Cybern. 18(1), 183\u2013190 (1988)","DOI":"10.1109\/21.87068"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,26]],"date-time":"2021-10-26T23:05:55Z","timestamp":1635289555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87756-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030877552","9783030877569"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87756-9_5","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)"}}]}}