IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1908.08474.html

The many Shapley values for model explanation

Author

Listed:
  • Mukund Sundararajan
  • Amir Najmi

Abstract

The Shapley value has become a popular method to attribute the prediction of a machine-learning model on an input to its base features. The use of the Shapley value is justified by citing [16] showing that it is the \emph{unique} method that satisfies certain good properties (\emph{axioms}). There are, however, a multiplicity of ways in which the Shapley value is operationalized in the attribution problem. These differ in how they reference the model, the training data, and the explanation context. These give very different results, rendering the uniqueness result meaningless. Furthermore, we find that previously proposed approaches can produce counterintuitive attributions in theory and in practice---for instance, they can assign non-zero attributions to features that are not even referenced by the model. In this paper, we use the axiomatic approach to study the differences between some of the many operationalizations of the Shapley value for attribution, and propose a technique called Baseline Shapley (BShap) that is backed by a proper uniqueness result. We also contrast BShap with Integrated Gradients, another extension of Shapley value to the continuous setting.

Suggested Citation

  • Mukund Sundararajan & Amir Najmi, 2019. "The many Shapley values for model explanation," Papers 1908.08474, arXiv.org, revised Feb 2020.
  • Handle: RePEc:arx:papers:1908.08474
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1908.08474
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Friedman, Eric & Moulin, Herve, 1999. "Three Methods to Share Joint Costs or Surplus," Journal of Economic Theory, Elsevier, vol. 87(2), pages 275-312, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dangxing Chen, 2023. "Can I Trust the Explanations? Investigating Explainable Machine Learning Methods for Monotonic Models," Papers 2309.13246, arXiv.org.
    2. Yves Sprumont, 2010. "An Axiomatization of the Serial Cost-Sharing Method," Econometrica, Econometric Society, vol. 78(5), pages 1711-1748, September.
    3. Hervé Moulin & Yves Sprumont, 2007. "Fair allocation of production externalities : recent results," Revue d'économie politique, Dalloz, vol. 117(1), pages 7-36.
    4. Koster, M.A.L., 1998. "Multi-Service Serial Cost Sharing : A Characterization of the Moulin-Shenker Rule," Discussion Paper 1998-06, Tilburg University, Center for Economic Research.
    5. Friedman, Eric J., 2012. "Asymmetric Cost Sharing mechanisms," Games and Economic Behavior, Elsevier, vol. 75(1), pages 139-151.
    6. Hougaard, Jens Leth & Moreno-Ternero, Juan D. & Tvede, Mich & Østerdal, Lars Peter, 2017. "Sharing the proceeds from a hierarchical venture," Games and Economic Behavior, Elsevier, vol. 102(C), pages 98-110.
    7. Eric Bahel & Christian Trudeau, 2018. "Consistency requirements and pattern methods in cost sharing problems with technological cooperation," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 737-765, September.
    8. Friedman, Eric J., 2002. "Strategic properties of heterogeneous serial cost sharing," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 145-154, November.
    9. Chen, Yan, 2003. "An experimental study of serial and average cost pricing mechanisms," Journal of Public Economics, Elsevier, vol. 87(9-10), pages 2305-2335, September.
    10. Watts, Alison, 2002. "Uniqueness of equilibrium in cost sharing games," Journal of Mathematical Economics, Elsevier, vol. 37(1), pages 47-70, February.
    11. Wang, Yun-Tong & Zhu, Daxin, 2002. "Ordinal proportional cost sharing," Journal of Mathematical Economics, Elsevier, vol. 37(3), pages 215-230, May.
    12. Mariusz Kaleta & Eugeniusz Toczyłowski, 2009. "A cost allocation framework for LP and GLP games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 19(4), pages 27-46.
    13. Koster, M.A.L., 1998. "Multi-Service Serial Cost Sharing : A Characterization of the Moulin-Shenker Rule," Other publications TiSEM 4d029e40-e4e7-4f90-b963-d, Tilburg University, School of Economics and Management.
    14. Eric Friedman, 1997. "Weak and Strong Consistency in Additive Cost Sharing," Departmental Working Papers 199707, Rutgers University, Department of Economics.
    15. Anna Bogomolnaia & Herv'e Moulin, 2024. "Guaranteed shares of benefits and costs," Papers 2406.14198, arXiv.org, revised Jul 2025.
    16. Jop Schouten & Mirjam GrooteSchaarsberg & Peter Borm, 2024. "Cost sharing methods for capacity restricted cooperative purchasing situations," Review of Economic Design, Springer;Society for Economic Design, vol. 28(2), pages 347-390, June.
    17. Sprumont, Yves, 2000. "Coherent Cost-Sharing Rules," Games and Economic Behavior, Elsevier, vol. 33(1), pages 126-144, October.
    18. Mariusz Kaleta & Eugeniusz Toczylowski, 2009. "A cost allocation framework for lp and glp games," Operations Research and Decisions, Wroclaw University of Technology, Institute of Organization and Management, vol. 4, pages 27-46.
    19. Moulin, Herve & Sprumont, Yves, 2006. "Responsibility and cross-subsidization in cost sharing," Games and Economic Behavior, Elsevier, vol. 55(1), pages 152-188, April.
    20. Hougaard, Jens Leth & Tind, Jørgen, 2009. "Cost allocation and convex data envelopment," European Journal of Operational Research, Elsevier, vol. 194(3), pages 939-947, May.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1908.08474. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.