DBScholar

Back to papers

When is Shapley Value Computation a Matter of Counting?

Summary: Connects Shapley value computation (SVC) to FGMC via reductions, clarifying when SVC hardness mirrors FGMC for fixed-query sub-databases. Establishes FP-#P dichotomies for constant-free unions of connected conjunctive queries and for connected, homomorphism-closed graph queries; also studies variants that disallow assumed facts or counting constants. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
1968
Venue
PODS
Year
2024
Pagerank
6.1313425e-05
Overall Rank
5,657 | 61.19%
DOI
10.1145/3651606

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{bienvenu_pods24,
        address = {New York, NY, USA},
        series = {{PODS} '24},
        title = {{When is Shapley Value Computation a Matter of Counting?}},
        url = {https://dl.acm.org/doi/10.1145/3651606},
        doi = {10.1145/3651606},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bienvenu, Meghyn and Figueira, Diego and Lafourcade, Pierre},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 6 of 6 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