Fast Approximation of Shapley Values Through Fractional Factorial Designs

DOI10.1080/01621459.2025.2529027MaRDI QIDQ7231174zbMATH OpenFDO

Authors Zheng Zhou, Robert Mee, Herbert Hamers, Wei Zheng

Publication date 21 April 2026

Published in Journal of the American Statistical Association (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/01621459.2025.2529027

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• A Component-Position Model, Analysis and Design for Order-of-Addition Experiments
• A Simple Expression for the Shapley Value in a Special Case
• A course in game theory.
• A linear approximation method for the Shapley value
• A polynomial rule for the problem of sharing delay costs in PERT networks
• Design and Analysis of Experiments
• Efficient computation of the Shapley value for game-theoretic network centrality
• Fast Approximation of the Shapley Values Based on Order-of-Addition Experimental Designs
• Polynomial calculation of the Shapley value based on sampling
• The many Shapley values for explainable artificial intelligence: a sensitivity analysis perspective
• Theory and application of uniform experimental designs

This page was built for publication: Fast Approximation of Shapley Values Through Fractional Factorial Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231174)