English
Related papers

Related papers: A Polynomial-Time Axiomatic Alternative to SHAP fo…

200 papers

According to Shapley's game-theoretical result, there exists a unique game value of finite cooperative games that satisfies axioms on additivity, efficiency, null-player property and symmetry. The original setting requires symmetry with…

Computer Science and Game Theory · Computer Science 2013-08-29 Ales Antonin Kubena , Peter Franek

In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with level structures. In the case of the equal…

Computer Science and Game Theory · Computer Science 2024-01-31 J. M. Alonso-Meijide , J. Costa , I. García-Jurado , J. C. Gonçalves-Dosantos

Asymmetric evolutionary games, such as the Ultimatum Game, provide keys to understanding the emergence of fairness in social species. Building on this framework, we explore the evolution of social value systems and the operational role that…

Physics and Society · Physics 2025-05-13 Hana Krakovská , Rudolf Hanel

Explaining AI systems is fundamental both to the development of high performing models and to the trust placed in them by their users. The Shapley framework for explainability has strength in its general applicability combined with its…

Machine Learning · Statistics 2021-12-21 Christopher Frye , Colin Rowat , Ilya Feige

Definable zero-sum stochastic games involve a finite number of states and action sets, reward and transition functions that are definable in an o-minimal structure. Prominent examples of such games are finite, semi-algebraic or globally…

Optimization and Control · Mathematics 2015-01-05 Jérôme Bolte , Stéphane Gaubert , Guillaume Vigeral

This paper considers a dynamic game with transferable utilities (TU), where the characteristic function is a continuous-time bounded mean ergodic process. A central planner interacts continuously over time with the players by choosing the…

Computer Science and Game Theory · Computer Science 2012-04-24 Dario Bauso , Puduru Viswanadha Reddy , Tamer Basar

Recent advances in game informatics have enabled us to find strong strategies across a diverse range of games. However, these strategies are usually difficult for humans to interpret. On the other hand, research in Explainable Artificial…

Multiagent Systems · Computer Science 2024-03-13 Satoru Fujii

SHAP is a popular approach to explain black-box models by revealing the importance of individual features. As it ignores feature interactions, SHAP explanations can be confusing up to misleading. NSHAP, on the other hand, reports the…

Machine Learning · Computer Science 2024-04-22 Sascha Xu , Joscha Cüppers , Jilles Vreeken

The latest developments in AI focus on agentic systems where artificial and human agents cooperate to realize global goals. An example is collaborative learning, which aims to train a global model based on data from individual agents. A…

Computer Science and Game Theory · Computer Science 2025-08-20 Björn Filter , Ralf Möller , Özgür Lütfü Özçep

This paper concerns the analysis of the Shapley value in matching games. Matching games constitute a fundamental class of cooperative games which help understand and model auctions and assignments. In a matching game, the value of a…

Computer Science and Game Theory · Computer Science 2013-07-02 Haris Aziz , Bart de Keijzer

Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective.…

Computer Science and Game Theory · Computer Science 2023-07-14 Christel Baier , Krishnendu Chatterjee , Tobias Meggendorfer , Jakob Piribauer

We study fair allocation of profit (or cost) for three central problems from combinatorial optimization: Max-Flow, MST and $b$-matching. The essentially unequivocal choice of solution concept for this purpose would be the core, because of…

Computer Science and Game Theory · Computer Science 2025-02-12 Rohith R. Gangam , Naveen Garg , Parnian Shahkar , Vijay V. Vazirani

Explainable AI (XAI) is increasingly essential as modern models become more complex and high-stakes applications demand transparency, trust, and regulatory compliance. Existing global attribution methods often incur high computational…

Machine Learning · Computer Science 2025-11-21 Poushali Sengupta , Yan Zhang , Frank Eliassen , Sabita Maharjan

Allocating costs, benefits, and emissions fairly among power system participant entities represents a persistent challenge. The Shapley value provides an axiomatically fair solution, yet computational barriers have limited its adoption…

Systems and Control · Electrical Eng. & Systems 2025-11-04 Yuanhao Feng , Tao Sun , Yan Meng , Xuxin Yang , Donghan Feng

Classical objectives in two-player zero-sum games played on graphs often deal with limit behaviors of infinite plays: e.g., mean-payoff and total-payoff in the quantitative setting, or parity in the qualitative one (a canonical way to…

Logic in Computer Science · Computer Science 2016-09-21 Véronique Bruyère , Quentin Hautem , Mickael Randour

In social choice theory, anonymity (all agents being treated equally) and neutrality (all alternatives being treated equally) are widely regarded as ``minimal demands'' and ``uncontroversial'' axioms of equity and fairness. However, the ANR…

Computer Science and Game Theory · Computer Science 2023-07-14 Lirong Xia

Two straightforward methods to extend an assessment of individual elements to groups are to sum individual assessments or to treat the group as a single merged element and assess it accordingly. In this work, we analyze another natural…

Computer Science and Game Theory · Computer Science 2026-05-21 Piotr Kępczyński , Oskar Skibski

SHAP (SHapley Additive exPlanation) values provide a game theoretic interpretation of the predictions of machine learning models based on Shapley values. While exact calculation of SHAP values is computationally intractable in general, a…

Machine Learning · Computer Science 2022-02-04 Rory Mitchell , Eibe Frank , Geoffrey Holmes

The two standard fairness notions in the resource allocation literature are proportionality and envy-freeness. If there are n agents competing for the available resources, then proportionality requires that each agent receives at least a…

Computer Science and Game Theory · Computer Science 2025-04-22 Arash Ashuri , Vasilis Gkatzelis

A central task of artificial intelligence is the design of artificial agents that act towards specified goals in partially observed environments. Since such environments frequently include interaction over time with other agents with their…

Computer Science and Game Theory · Computer Science 2012-05-14 Miroslav Dudik , Geoffrey Gordon
‹ Prev 1 4 5 6 7 8 10 Next ›