Polynomial-time exact ASV computation for rooted trees via topological equivalence classes, plus sampling approximation for arbitrary causal DAGs.
Knuth and Jayme L
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Beyond Shapley: Efficient Computation of Asymmetric Shapley Values
Polynomial-time exact ASV computation for rooted trees via topological equivalence classes, plus sampling approximation for arbitrary causal DAGs.