An Algorithmic Treatment of Causal Unit Selection †
Haiying Huang, Adnan Darwiche · 2026
Read An Algorithmic Treatment of Causal Unit Selection † by Haiying Huang, Adnan Darwiche (2026) in the Tower of Babel, a free online library of public-domain works preserved in clean, searchable text. No sign-up. The full text is served as a plain-text file at a predictable URL, where text is present: https://antarctic-labs.com/tower-of-babel/pmc-13206126.txt.
Description
Haiying Huang and Adnan Darwiche present a theory paper from 2026 on how to pick the best units when a goal is stated in causal terms. Earlier work asked which people would gain most from an action, scored by what would happen under different choices. That work mostly set bounds on the score rather than computing the best pick.
The authors treat the task as a computing problem when a full causal model is known. They show how a wide class of such goals can be recast as a plain chance question on a new model they build for the goal. On that model, a standard method finds the exact best units. They also map how hard the problem is in the worst case.
Catalog record
| CREATOR | Haiying Huang, Adnan Darwiche |
|---|---|
| YEAR | 2026 |
| COLLECTION | PAPERS |
| FORMAT | TXT |
| FILE SIZE | 82 KB |
| VERSION | 1.0 |
| LICENSE | CC BY 4.0 |
| RIGHTS | CC BY |
| SOURCE | Europe PMC |