Shapley Revisited: Tractable Responsibility Measures for Query Answers
Summary: Revisits Shapley-based responsibility for query answers and proposes WSMS as a tractable alternative. WSMS equates to Shapley values of a tailored game and yields tractable data complexity for many queries, including UCQs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Meghyn Bienvenu (Bordeaux Laboratory for Computer Science; Centre National de la Recherche Scientifique; National Polytechnic Institute of Bordeaux; University of Bordeaux)
- 2. Diego Figueira (Bordeaux Laboratory for Computer Science; Centre National de la Recherche Scientifique; National Polytechnic Institute of Bordeaux; University of Bordeaux)
- 3. Pierre Lafourcade (Bordeaux Laboratory for Computer Science; Centre National de la Recherche Scientifique; National Polytechnic Institute of Bordeaux; University of Bordeaux)
BibTeX Citation
@inproceedings{bienvenu_pods25,
address = {New York, NY, USA},
series = {{PODS} '25},
title = {{Shapley Revisited: Tractable Responsibility Measures for Query Answers}},
url = {https://dl.acm.org/doi/10.1145/3725249},
doi = {10.1145/3725249},
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 = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,399 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 578 | The Complexity of Causality and Responsibility for Query Answers and non-Answers | 2011 | VLDB | 0.00016096504 |
| 818 | Hypertree Decompositions: Questions and Answers | 2016 | PODS | 0.0001366708 |
| 2,217 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD | 8.8172185e-05 |
| 2,722 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS | 8.0955983e-05 |
| 4,002 | From Shapley Value to Model Counting and Back | 2024 | PODS | 6.8607198e-05 |
| 5,514 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS | 6.0978288e-05 |
| 5,791 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS | 5.9937717e-05 |
| 5,793 | Banzhaf Values for Facts in Query Answering | 2024 | SIGMOD | 5.9930101e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 578 | The Complexity of Causality and Responsibility for Query Answers and non-Answers | 2011 | VLDB |
| 2 | 6,553 | A Comprehensive Study of Shapley Value in Data Analytics | 2025 | VLDB |
| 3 | 5,055 | ShapGraph: An Holistic View of Explanations through Provenance Graphs and Shapley Values | 2022 | SIGMOD |
| 4 | 5,428 | Fast Shapley Value Computation in Data Assemblage Tasks as Cooperative Simple Games | 2024 | SIGMOD |
| 5 | 4,002 | From Shapley Value to Model Counting and Back | 2024 | PODS |
| 6 | 5,791 | When is Shapley Value Computation a Matter of Counting? | 2024 | PODS |
| 7 | 5,514 | Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases | 2024 | PODS |
| 8 | 10,399 | Tractability Frontiers of the Shapley Value for Aggregate Conjunctive Queries | 2026 | PODS |
| 9 | 2,217 | Computing the Shapley Value of Facts in Query Answering | 2022 | SIGMOD |
| 10 | 2,722 | The Impact of Negation on the Complexity of the Shapley Value in Conjunctive Queries | 2020 | PODS |