Fetching the paper…
Reading the bibliography…
Shapley values, originating in game theory and increasingly prominent in explainable AI, have been proposed to assess the contribution of facts in query answering over databases, along with other similar power indices such as Banzhaf values.
A value for n-person games
Lloyd S. Shapley et al · 1953
Earlier work this paper cites.
Weighted voting doesn’t work: A mathematical analysis
John F Banzhaf III. 1964 · 1964
Earlier work this paper cites.
On the complexity of derivation in propositional calculus
G Tseitin. 1968 · 1968
Earlier work this paper cites.
Multilinear extensions of games
Guillermo Owen. 1972 · 1972
Earlier work this paper cites.
National sovereignty and national power in European institutions
Ron J Johnston. 1977 · 1977
Earlier work this paper cites.
A new index of power for simple n-person games
John Deegan and Edward W Packel. 1978 · 1978
Earlier work this paper cites.
On the measurement of power: Some reactions to Laver
Ronald John Johnston. 1978 · 1978
Earlier work this paper cites.
Power, luck and the right index
Manfred J Holler and Edward W Packel. 1983 · 1983
Earlier work this paper cites.
The complexity of counting cuts and of computing the probability that a graph is connected
J Scott Provan and Michael O Ball. 1983 · 1983
Earlier work this paper cites.
Random generation of combinatorial structures from a uniform distribution
Mark R Jerrum, Leslie G Valiant, and Vijay V Vazirani. 1986 · 1986
Earlier work this paper cites.
Probabilistic values for games
Robert J Weber. 1988 · 1988
Earlier work this paper cites.
Foundations of Databases
Serge Abiteboul, Richard Hull, and Victor Vianu. 1995 · 1995
Earlier work this paper cites.
On the choice of a power index
Annick Laruelle. 1999 · 1999
Earlier work this paper cites.
Potential, value, and coalition formation
Annick Laruelle and Federico Valenciano. 2008 · 2008
Earlier work this paper cites.
Power indices and minimal winning coalitions
Werner Kirsch and Jessica Langner. 2010 · 2010
Cited alongside, same era.
Probabilistic Databases
Dan Suciu, Dan Olteanu, Christopher Ré, and Christoph Koch. 2011 · 2011
Cited alongside, same era.
The dichotomy of probabilistic inference for unions of conjunctive queries
Nilesh Dalvi and Dan Suciu. 2013 · 2013
Cited alongside, same era.
Coalitional multinomial probabilistic values
Francesc Carreras and Maria Albina Puente. 2015a · 2015
Cited alongside, same era.
Multinomial probabilistic values
Francesc Carreras and María Albina Puente. 2015b · 2015
Cited alongside, same era.
The prediction value
Maurice Koster, Sascha Kurz, Ines Lindner, and Stefan Napel. 2017 · 2017
Cited alongside, same era.
The Shapley value of tuples in query answering
Ester Livshits, Leopoldo Bertossi, Benny Kimelfeld, and Moshe Sebag. 2021 · 2021
Later among the works it cites.
Database Theory
Marcelo Arenas, Pablo Barceló, Leonid Libkin, Wim Martens, and Andreas Pieris. 2022 · 2022
Later among the works it cites.
Computing the Shapley Value of Facts in Query Answering. In SIGMOD Conference . 1570–1583
Daniel Deutch, Nave Frost, Benny Kimelfeld, and Mikaël Monet. 2022 · 2022
Later among the works it cites.
Improved feature importance computation for tree models based on the Banzhaf value. In UAI
Adam Karczmarz, Tomasz P. Michalak, Anish Mukherjee, Piotr Sankowski, and Piotr Wygocki. 2022 · 2022
Later among the works it cites.
On the tractability of SHAP explanations
Guy Van den Broeck, Anton Lykov, Maximilian Schleich, and Dan Suciu. 2022 · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Jean-Marie Lagniez and Pierre Marquis. 2017 · 2017
Cited alongside, same era.
Provenance and Probabilities in Relational Databases: From Theory to Practice
Pierre Senellart. 2017 · 2017
Cited alongside, same era.
Connecting knowledge compilation classes and width parameters
Antoine Amarilli, Florent Capelli, Mikaël Monet, and Pierre Senellart. 2020 · 2020
Cited alongside, same era.
The Shapley value of tuples in query answering. In ICDT , Vol. 155. 20:1–20:19
Ester Livshits, Leopoldo E. Bertossi, Benny Kimelfeld, and Moshe Sebag. 2020 · 2020
Cited alongside, same era.
Solving a Special Case of the Intensional vs Extensional Conjecture in Probabilistic Databases. In PODS . 149–163
Mikaël Monet. 2020 · 2020
Cited alongside, same era.
The impact of negation on the complexity of the Shapley value in conjunctive queries. In PODS . 285–297
Alon Reshef, Benny Kimelfeld, and Ester Livshits. 2020 · 2020
Cited alongside, same era.
Omer Abramovich, Daniel Deutch, Nave Frost, Ahmet Kara, and Dan Olteanu. 2023 · 2023
Later among the works it cites.
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries. In ICDT (LIPIcs, Vol. 255) . 14:1–14:17
Antoine Amarilli. 2023 · 2023
Later among the works it cites.
J. Mach. Learn. Res. 24, 63 (2023), 1–58
Marcelo Arenas, Pablo Barceló, Leopoldo E Bertossi, and Mikaël Monet. 2023 · 2023
Later among the works it cites.
The Shapley value in database management
Leopoldo Bertossi, Benny Kimelfeld, Ester Livshits, and Mikaël Monet. 2023 · 2023
Later among the works it cites.
The Expected Shapley value on a class of probabilistic games
Surajit Borkotokey, Sujata Gowala, and Rajnish Kumar. 2023 · 2023
Later among the works it cites.
When is Shapley Value Computation a Matter of Counting?. In PODS
Meghyn Bienvenu, Diego Figueira, and Pierre Lafourcade. 2024 · 2024
Closest in time.
From Shapley Value to Model Counting and Back. In PODS
Ahmet Kara, Dan Olteanu, and Dan Suciu. 2024 · 2024
Closest in time.
ProvSQL: Provenance and Probability Management in PostgreSQL
Pierre Senellart, Louis Jachiet, Silviu Maniu, and Yann Ramusat. 2018 · 2037
Closest in time.