Related papers: Towards Attributions of Input Variables in a Coalition

Related papers

Exit-and-Join Dynamics and Equilibrium in Continuum Cooperative Games [20.036142577511455]
We develop a continuum theory of exit-and-join coalition dynamics in nonatomic cooperative games.<n>We derive mean-field dynamics from decentralized switching rules and show that payoff-difference switching recovers replicator dynamics.<n>The proposed theory unifies cooperative value allocation, noncooperative coalition mobility, mean-field dynamics, evolutionary game theory, and population games.
arXiv Detail & Related papers (2026-06-27T09:17:07Z)
ConfoundingSHAP: Quantifying confounding strength in causal inference [70.18600230387723]
In causal inference, confounders are variables that influence both treatment decisions and outcomes.<n>We introduce ConfoundingSHAP, a Shapley-based method for attributing confounding strength to individual covariates.<n>We demonstrate the practical value across various datasets.
arXiv Detail & Related papers (2026-05-11T13:19:33Z)
Creator Incentives in Recommender Systems: A Cooperative Game-Theoretic Approach for Stable and Fair Collaboration in Multi-Agent Bandits [18.15244869689104]
We analyze collaboration as a multi-agent linear bandit problem with a transferable utility (TU) cooperative game formulation.<n>We show that, for identical (homogenous) agents with fixed action sets, the induced TU game is convex under mild algorithmic conditions.<n>We propose a simple regret-based payout rule that satisfies three out of the four Shapley axioms and also lies in the core.
arXiv Detail & Related papers (2026-04-09T17:45:15Z)
Towards Uniformity and Alignment for Multimodal Representation Learning [66.87764574237532]
We identify two conflicts in the multimodal regime, both exacerbated as the number of modalities increases.<n>We propose a principled decoupling of alignment and uniformity for multimodal representations.<n>We then provide a theoretical guarantee that our method acts as an efficient proxy for a global Hlder divergence over multiple modality distributions.
arXiv Detail & Related papers (2026-02-10T08:08:07Z)
Metric Hedonic Games on the Line [4.832821031860376]
We study a novel succinct variant related to modified fractional hedonic games.<n>In particular, we investigate natural variants where an agent's cost is defined by distance thresholds.<n>We find that stable coalition structures always exist but that their properties and quality can vary widely.
arXiv Detail & Related papers (2026-02-05T17:05:08Z)
Feasible strategies for conflict resolution within intuitionistic fuzzy preference-based conflict situations [14.046056867216285]
We introduce an intuitionistic fuzzy preference-based conflict situation that captures agents' attitudes towards issue pairs with finer granularity than that afforded by classical preference-based models.<n>We construct three-way conflict analysis models for trisecting the set of agent pairs, the agent set, and the issue set.<n>We present adjustment mechanism-based feasible strategies that simultaneously account for both adjustment magnitudes and conflict degrees.
arXiv Detail & Related papers (2026-02-03T11:30:34Z)
CORA: Coalitional Rational Advantage Decomposition for Multi-Agent Policy Gradients [1.1592964544667297]
This work focuses on the credit assignment problem in cooperative multi-agent reinforcement learning (MARL)<n>We propose a credit assignment method called Coalitional Rational Advantage Decomposition (CORA)<n>Experiments on matrix games, differential games, and multi-agent collaboration benchmarks demonstrate that CORA outperforms strong baselines.
arXiv Detail & Related papers (2025-06-03T08:04:43Z)
Conflicts in Texts: Data, Implications and Challenges [58.03478157713084]
Conflicts could reflect the complexity of situations, changes that need to be explained and dealt with, difficulties in data annotation, and mistakes in generated outputs. This survey categorizes these conflicts into three key areas: (1) natural texts on the web, where factual inconsistencies, subjective biases, and multiple perspectives introduce contradictions; (2) human-annotated data, where annotator disagreements, mistakes, and societal biases impact model training; and (3) model interactions, where hallucinations and knowledge conflicts emerge during deployment. We highlight key challenges and future directions for developing conflict-aware NLP systems that can reason over and reconcile conflicting information more effectively
arXiv Detail & Related papers (2025-04-28T04:24:01Z)
Shapley Value Approximation Based on k-Additive Games [21.023521613326654]
The Shapley value is the prevalent solution for fair division problems in which a payout is to be divided among multiple agents. Despite its popularity and axiomatic justification, the Shapley value suffers from a computational complexity that scales exponentially with the number of entities involved. We propose SVA$k_textADD$, a novel approximation method that fits a $k$-additive surrogate game.
arXiv Detail & Related papers (2025-02-07T08:52:57Z)
Predictive Churn with the Set of Good Models [61.00058053669447]
This paper explores connections between two seemingly unrelated concepts of predictive inconsistency. The first, known as predictive multiplicity, occurs when models that perform similarly produce conflicting predictions for individual samples. The second concept, predictive churn, examines the differences in individual predictions before and after model updates.
arXiv Detail & Related papers (2024-02-12T16:15:25Z)
Reducing Optimism Bias in Incomplete Cooperative Games [0.0]
We present a framework aimed at optimizing the sequence for revealing coalition values in cooperative games. Our contributions are threefold: (i) we study the individual players' optimistic completions of games with missing coalition values along with the arising gap, and investigate its analytical characteristics that facilitate more efficient optimization; (ii) we develop methods to minimize this gap over classes of games with a known prior by disclosing values of additional coalitions in both offline and online fashion; and (iii) we empirically demonstrate the algorithms' performance in practical scenarios.
arXiv Detail & Related papers (2024-02-02T21:58:26Z)
Coalitional Manipulations and Immunity of the Shapley Value [0.0]
We consider manipulations in the context of coalitional games, where a coalition aims to increase the total payoff of its members. An allocation rule is immune to coalitional manipulation if no coalition can benefit from internal reallocation of worth. For efficient allocation rules, reallocation-proofness is equivalent to constrained marginality.
arXiv Detail & Related papers (2023-10-31T12:43:31Z)
Delta-AI: Local objectives for amortized inference in sparse graphical models [64.5938437823851]
We present a new algorithm for amortized inference in sparse probabilistic graphical models (PGMs) Our approach is based on the observation that when the sampling of variables in a PGM is seen as a sequence of actions taken by an agent, sparsity of the PGM enables local credit assignment in the agent's policy learning objective. We illustrate $Delta$-AI's effectiveness for sampling from synthetic PGMs and training latent variable models with sparse factor structure.
arXiv Detail & Related papers (2023-10-03T20:37:03Z)
On the Convergence of the Shapley Value in Parametric Bayesian Learning Games [28.212413634171572]
We show that for any two players, their difference in Shapley value converges in probability to the difference in Shapley value of a limiting game whose characteristic function is proportional to the log-determinant of the joint Fisher information. Our result enables this to be achieved without any costly computations of posterior-prior KL divergences.
arXiv Detail & Related papers (2022-05-16T02:29:14Z)
An Instance-Dependent Analysis for the Cooperative Multi-Player Multi-Armed Bandit [93.97385339354318]
We study the problem of information sharing and cooperation in Multi-Player Multi-Armed bandits. First, we show that a simple modification to a successive elimination strategy can be used to allow the players to estimate their suboptimality gaps. Second, we leverage the first result to design a communication protocol that successfully uses the small reward of collisions to coordinate among players.
arXiv Detail & Related papers (2021-11-08T23:38:47Z)
Collective eXplainable AI: Explaining Cooperative Strategies and Agent Contribution in Multiagent Reinforcement Learning with Shapley Values [68.8204255655161]
This study proposes a novel approach to explain cooperative strategies in multiagent RL using Shapley values. Results could have implications for non-discriminatory decision making, ethical and responsible AI-derived decisions or policy making under fairness constraints.
arXiv Detail & Related papers (2021-10-04T10:28:57Z)
Apportionment with Parity Constraints [1.52292571922932]
We consider the question of how to allocate seats of a parliament under parity constraints between candidate types. A typical benchmark used in the context of two-dimensional apportionment is the fair share, which corresponds to an ideal fractional biproportional solution.
arXiv Detail & Related papers (2021-08-09T16:08:12Z)
Dealing with Non-Stationarity in Multi-Agent Reinforcement Learning via Trust Region Decomposition [52.06086375833474]
Non-stationarity is one thorny issue in multi-agent reinforcement learning. We introduce a $delta$-stationarity measurement to explicitly model the stationarity of a policy sequence. We propose a trust region decomposition network based on message passing to estimate the joint policy divergence.
arXiv Detail & Related papers (2021-02-21T14:46:50Z)
Improving KernelSHAP: Practical Shapley Value Estimation via Linear Regression [9.89901717499058]
We revisit the idea of estimating Shapley values via linear regression to understand and improve upon this approach. We develop techniques to detect its convergence and calculate uncertainty estimates. We develop a version of KernelSHAP for cooperative games that yields fast new estimators for two global explanation methods.
arXiv Detail & Related papers (2020-12-02T21:20:47Z)
End-to-End Learning and Intervention in Games [60.41921763076017]
We provide a unified framework for learning and intervention in games. We propose two approaches, respectively based on explicit and implicit differentiation. The analytical results are validated using several real-world problems.
arXiv Detail & Related papers (2020-10-26T18:39:32Z)
Implicit Distributional Reinforcement Learning [61.166030238490634]
implicit distributional actor-critic (IDAC) built on two deep generator networks (DGNs) Semi-implicit actor (SIA) powered by a flexible policy distribution. We observe IDAC outperforms state-of-the-art algorithms on representative OpenAI Gym environments.
arXiv Detail & Related papers (2020-07-13T02:52:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.