Show simple item record

dc.contributor.authorJain, Shomik
dc.contributor.authorWang, Margaret
dc.contributor.authorCreel, Kathleen
dc.contributor.authorWilson, Ashia
dc.date.accessioned2025-12-16T21:28:14Z
dc.date.available2025-12-16T21:28:14Z
dc.date.issued2025-06-23
dc.identifier.isbn979-8-4007-1482-5
dc.identifier.urihttps://hdl.handle.net/1721.1/164351
dc.descriptionFAccT ’25, Athens, Greeceen_US
dc.description.abstractThe Rashomon set of equally-good models promises less discriminatory algorithms, reduced outcome homogenization, and fairer decisions through model ensembles or reconciliation. However, we argue from the perspective of allocation multiplicity that these promises may remain unfulfilled. When there are more qualified candidates than resources available, many different allocations of scarce resources can achieve the same utility. This space of equal-utility allocations may not be faithfully reflected by the Rashomon set, as we show in a case study of healthcare allocations. We attribute these unfulfilled promises to several factors: limitations in empirical methods for sampling from the Rashomon set, the standard practice of deterministically selecting individuals with the lowest risk, and structural biases that cause all equally-good models to view some qualified individuals as inherently risky.en_US
dc.publisherACM|The 2025 ACM Conference on Fairness, Accountability, and Transparencyen_US
dc.relation.isversionofhttps://doi.org/10.1145/3715275.3732138en_US
dc.rightsCreative Commons Attributionen_US
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/en_US
dc.sourceAssociation for Computing Machineryen_US
dc.titleAllocation Multiplicity: Evaluating the Promises of the Rashomon Seten_US
dc.typeArticleen_US
dc.identifier.citationShomik Jain, Margaret Wang, Kathleen Creel, and Ashia Wilson. 2025. Allocation Multiplicity: Evaluating the Promises of the Rashomon Set. In Proceedings of the 2025 ACM Conference on Fairness, Accountability, and Transparency (FAccT '25). Association for Computing Machinery, New York, NY, USA, 2040–2055.en_US
dc.contributor.departmentMIT Institute for Data, Systems, and Societyen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.identifier.mitlicensePUBLISHER_POLICY
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2025-08-01T08:35:32Z
dc.language.rfc3066en
dc.rights.holderThe author(s)
dspace.date.submission2025-08-01T08:35:32Z
mit.licensePUBLISHER_CC
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record