Database Paper Browser

Back to papers

From Shapley Value to Model Counting and Back

Summary: Proves a polynomial-time equivalence between computing Shapley values and model counting for any Boolean class closed under substituting variables by disjunctions of fresh variables. Yields poly-time Shapley on deterministic decomposable circuits and a tight dichotomy for self‑join‑free Boolean CQs, with non‑hierarchical hardness via #P model-counting reductions on DNF lineage. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1910
Venue
PODS
Year
2024
Pagerank
6.0619399e-05
Overall Rank
4,591 | 68.07%
DOI
10.1145/3651142

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 5 of 5 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers