{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:09:48Z","timestamp":1750219788187,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":7,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T00:00:00Z","timestamp":1672790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,4]]},"DOI":"10.1145\/3570991.3571039","type":"proceedings-article","created":{"date-parts":[[2023,1,5]],"date-time":"2023-01-05T04:13:03Z","timestamp":1672891983000},"page":"293-294","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Algorithmic Recourse based on User\u2019s Feature-order Preference"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3497-6805","authenticated-orcid":false,"given":"Manan","family":"Singh","sequence":"first","affiliation":[{"name":"Indian Institute of Technology Palakkad, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9300-7209","authenticated-orcid":false,"given":"Sai Srinivas","family":"Kancheti","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Hyderabad, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0633-3917","authenticated-orcid":false,"given":"Shivam","family":"Gupta","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Ropar, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5049-4764","authenticated-orcid":false,"given":"Ganesh","family":"Ghalme","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Hyderabad, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2666-9058","authenticated-orcid":false,"given":"Shweta","family":"Jain","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Ropar, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6132-0310","authenticated-orcid":false,"given":"Narayanan","family":"C. Krishnan","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Palakkad, India"}]}],"member":"320","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The modern theory of consumer behavior: Ordinal or cardinal?The Quarterly Journal of Austrian Economics 6, 1","author":"Barnett William","year":"2003","unstructured":"William Barnett. 2003. The modern theory of consumer behavior: Ordinal or cardinal?The Quarterly Journal of Austrian Economics 6, 1 (2003), 41\u201365."},{"key":"e_1_3_2_1_2_1","unstructured":"FICO. 2018. Explainable machine learning challenge.https:\/\/community.fico.com\/s\/explainable-machine-learning-challenge."},{"key":"e_1_3_2_1_3_1","unstructured":"Amir-Hossein Karimi Gilles Barthe Bernhard Sch\u00f6lkopf and Isabel Valera. 2020. A survey of algorithmic recourse: definitions formulations solutions and prospects. arXiv preprint arXiv:2010.04050(2020)."},{"key":"e_1_3_2_1_4_1","volume-title":"Towards robust and reliable algorithmic recourse. Advances in Neural Information Processing Systems 34","author":"Upadhyay Sohini","year":"2021","unstructured":"Sohini Upadhyay, Shalmali Joshi, and Himabindu Lakkaraju. 2021. Towards robust and reliable algorithmic recourse. Advances in Neural Information Processing Systems 34 (2021)."},{"key":"e_1_3_2_1_5_1","unstructured":"Sahil Verma John Dickerson and Keegan Hines. 2020. Counterfactual explanations for machine learning: A review. arXiv preprint arXiv:2010.10596(2020)."},{"key":"e_1_3_2_1_6_1","first-page":"841","article-title":"Counterfactual explanations without opening the black box: Automated decisions and the GDPR","volume":"31","author":"Wachter Sandra","year":"2017","unstructured":"Sandra Wachter, Brent Mittelstadt, and Chris Russell. 2017. Counterfactual explanations without opening the black box: Automated decisions and the GDPR. Harv. JL & Tech. 31(2017), 841.","journal-title":"Harv. JL & Tech."},{"key":"e_1_3_2_1_7_1","unstructured":"Prateek Yadav Peter Hase and Mohit Bansal. 2021. Low-cost algorithmic recourse for users with uncertain cost functions. arXiv preprint arXiv:2111.01235(2021)."}],"event":{"name":"CODS-COMAD 2023: 6th Joint International Conference on Data Science & Management of Data (10th ACM IKDD CODS and 28th COMAD)","acronym":"CODS-COMAD 2023","location":"Mumbai India"},"container-title":["Proceedings of the 6th Joint International Conference on Data Science & Management of Data (10th ACM IKDD CODS and 28th COMAD)"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570991.3571039","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3570991.3571039","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:54Z","timestamp":1750178274000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3570991.3571039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":7,"alternative-id":["10.1145\/3570991.3571039","10.1145\/3570991"],"URL":"https:\/\/doi.org\/10.1145\/3570991.3571039","relation":{},"subject":[],"published":{"date-parts":[[2023,1,4]]},"assertion":[{"value":"2023-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}