{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T15:54:56Z","timestamp":1776095696413,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T00:00:00Z","timestamp":1719014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MUR PNRR project FAIR - Future AI Research","award":["PE00000013"],"award-info":[{"award-number":["PE00000013"]}]},{"name":"Horizon Europe Programme, grant ELIAS","award":["101120237"],"award-info":[{"award-number":["101120237"]}]},{"name":"Horizon Europe Programme, grant TANGO","award":["101120763"],"award-info":[{"award-number":["101120763"]}]},{"name":"AI@Trento, FBK-Unitn"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,22]]},"DOI":"10.1145\/3627043.3659556","type":"proceedings-article","created":{"date-parts":[[2024,6,22]],"date-time":"2024-06-22T06:24:16Z","timestamp":1719037456000},"page":"249-254","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Preference Elicitation in Interactive and User-centered Algorithmic Recourse: an Initial Exploration"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-5976-5079","authenticated-orcid":false,"given":"Seyedehdelaram","family":"Esfahani","sequence":"first","affiliation":[{"name":"University of Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8387-9983","authenticated-orcid":false,"given":"Giovanni","family":"De Toni","sequence":"additional","affiliation":[{"name":"Department of Information Engineering and Computer Science, University of Trento, Italy and Fondazione Bruno Kessler, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1275-2333","authenticated-orcid":false,"given":"Bruno","family":"Lepri","sequence":"additional","affiliation":[{"name":"Center for Augmented Intelligence, FBK, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2765-5395","authenticated-orcid":false,"given":"Andrea","family":"Passerini","sequence":"additional","affiliation":[{"name":"Department of Information Engineering and Computer Science, University of Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5968-9936","authenticated-orcid":false,"given":"Katya","family":"Tentori","sequence":"additional","affiliation":[{"name":"Center for Mind\/Brain Sciences - CIMeC, University of Trento, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1554-5703","authenticated-orcid":false,"given":"Massimo","family":"Zancanaro","sequence":"additional","affiliation":[{"name":"Department of Psychology and Cognitive Science, University of Trento and FBK, Italy"}]}],"member":"320","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.24432\/C5XW20"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42786-020-00020-3"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-023-00933-9"},{"key":"e_1_3_2_1_4_1","unstructured":"Craig Boutilier. 2002. A POMDP formulation of preference elicitation problems. In AAAI. 239\u2013246."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-5251-4_103"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Ruth\u00a0MJ Byrne. 2019. Counterfactuals in Explainable Artificial Intelligence (XAI): Evidence from Human Reasoning.. In IJCAI. 6276\u20136282.","DOI":"10.24963\/ijcai.2019\/876"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030342"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2022.103224"},{"key":"e_1_3_2_1_9_1","volume-title":"International conference on computers and games. Springer, 72\u201383","author":"Coulom R\u00e9mi","year":"2006","unstructured":"R\u00e9mi Coulom. 2006. Efficient selectivity and backup operators in Monte-Carlo tree search. In International conference on computers and games. Springer, 72\u201383."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-022-06293-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3377325.3377536"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-022-00831-6"},{"key":"e_1_3_2_1_13_1","volume-title":"A survey of algorithmic recourse: definitions, formulations, solutions, and prospects. CoRR abs\/2010.04050","author":"Karimi Amir-Hossein","year":"2020","unstructured":"Amir-Hossein Karimi, Gilles Barthe, Bernhard Sch\u00f6lkopf, and Isabel Valera. 2020. A survey of algorithmic recourse: definitions, formulations, solutions, and prospects. CoRR abs\/2010.04050 (2020). arXiv:2010.04050https:\/\/arxiv.org\/abs\/2010.04050"},{"key":"e_1_3_2_1_14_1","volume-title":"Algorithmic recourse under imperfect causal knowledge: a probabilistic approach. Advances in neural information processing systems 33","author":"Karimi Amir-Hossein","year":"2020","unstructured":"Amir-Hossein Karimi, Julius Von\u00a0K\u00fcgelgen, Bernhard Sch\u00f6lkopf, and Isabel Valera. 2020. Algorithmic recourse under imperfect causal knowledge: a probabilistic approach. Advances in neural information processing systems 33 (2020), 265\u2013277."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139174084"},{"key":"e_1_3_2_1_16_1","volume-title":"Preserving causal constraints in counterfactual explanations for machine learning classifiers. arXiv preprint arXiv:1912.03277","author":"Mahajan Divyat","year":"2019","unstructured":"Divyat Mahajan, Chenhao Tan, and Amit Sharma. 2019. Preserving causal constraints in counterfactual explanations for machine learning classifiers. arXiv preprint arXiv:1912.03277 (2019)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2207676.2208573"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3375627.3375850"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"G. Ramakrishnan Y.\u00a0C. Lee and A. Albarghouthi. 2020. Synthesizing action sequences for modifying model decisions. In AAAI Vol.\u00a034. 5462\u20135469.","DOI":"10.1609\/aaai.v34i04.5996"},{"key":"e_1_3_2_1_20_1","volume-title":"An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747","author":"Ruder Sebastian","year":"2016","unstructured":"Sebastian Ruder. 2016. An overview of gradient descent optimization algorithms. arXiv preprint arXiv:1609.04747 (2016)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491102.3502098"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.9781\/ijimai.2017.09.001"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4539"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3419764"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Ben Shneiderman. 2022. Human-centered AI. Oxford University Press.","DOI":"10.1093\/oso\/9780192845290.001.0001"},{"key":"e_1_3_2_1_26_1","volume-title":"Personalized Algorithmic Recourse with Preference Elicitation. Transactions on Machine Learning Research","author":"Toni Giovanni\u00a0De","year":"2024","unstructured":"Giovanni\u00a0De Toni, Paolo Viappiani, Stefano Teso, Bruno Lepri, and Andrea Passerini. 2024. Personalized Algorithmic Recourse with Preference Elicitation. Transactions on Machine Learning Research (2024). https:\/\/openreview.net\/forum?id=8sg2I9zXgO"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3287560.3287566"},{"key":"e_1_3_2_1_28_1","volume-title":"Counterfactual explanations and algorithmic recourses for machine learning: A review. arXiv preprint arXiv:2010.10596","author":"Verma Sahil","year":"2020","unstructured":"Sahil Verma, Varich Boonsanong, Minh Hoang, Keegan\u00a0E Hines, John\u00a0P Dickerson, and Chirag Shah. 2020. Counterfactual explanations and algorithmic recourses for machine learning: A review. arXiv preprint arXiv:2010.10596 (2020)."},{"key":"e_1_3_2_1_29_1","volume-title":"Optimal bayesian recommendation sets and myopically optimal choice query sets. Advances in neural information processing systems 23","author":"Viappiani Paolo","year":"2010","unstructured":"Paolo Viappiani and Craig Boutilier. 2010. Optimal bayesian recommendation sets and myopically optimal choice query sets. Advances in neural information processing systems 23 (2010)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57959-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3063289"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10940-022-09545-w"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3544548.3580816"}],"event":{"name":"UMAP '24: 32nd ACM Conference on User Modeling, Adaptation and Personalization","location":"Cagliari Italy","acronym":"UMAP '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGCHI ACM Special Interest Group on Computer-Human Interaction"]},"container-title":["Proceedings of the 32nd ACM Conference on User Modeling, Adaptation and Personalization"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627043.3659556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627043.3659556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T19:45:09Z","timestamp":1755891909000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627043.3659556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,22]]},"references-count":33,"alternative-id":["10.1145\/3627043.3659556","10.1145\/3627043"],"URL":"https:\/\/doi.org\/10.1145\/3627043.3659556","relation":{},"subject":[],"published":{"date-parts":[[2024,6,22]]},"assertion":[{"value":"2024-06-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}