Optimal AI delegation reduces to choosing which human categories the machine should retain, and this subset-selection problem is NP-hard in general yet polynomial in separable settings.
Thus in all subsequent results, we will assume that𝐼𝐻∪𝐼𝑀 =[𝑑]
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Designing Algorithmic Delegates: The Role of Indistinguishability in Human-AI Handoff
Optimal AI delegation reduces to choosing which human categories the machine should retain, and this subset-selection problem is NP-hard in general yet polynomial in separable settings.