Flow methods for cooperative games with generalized coalition configuration

2024-11-20 · Encarnacion Algaba, Eric Remila, Philippe Solal

This paper introduces the class of cooperative games with generalized coalition configuration. This new class of games corresponds to cooperative games with coalition configuration and restricted cooperation. A coalition configuration is a collection of coalitions covering the agent set. The restriction of cooperation between agents is represented by a set system on each element of the coalition configuration. A coalition profile is a list of feasible coalitions, one for each element of the coalition configuration. A coalition profile function associates a worth with each coalition profile. Based on this framework, we define and axiomatically characterize marginal values whose coefficients induce a unitary flow on the product digraph obtained from these set systems. Next, we propose a two-step procedure, inspired by Owen's procedure, to construct flow methods as above. Then, we show that the associated flow is decomposable into two flows. Finally, we use two axioms to characterize the flows that can be decomposed in this way, and hence the flow methods constructed using our procedure.

📄 PDF Abstract BibTeX arXiv:2411.13684

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

SET Dynamic Sparse Training method where weight mask is updated randomly periodically

Implementations of Cooperative Games Under Non-Cooperative Solution Concepts

2024-02-22 · Justin Chan

Cooperative games can be distinguished as non-cooperative games in which players can freely sign binding agreements to form coalitions. These coalitions inherit a joint strategy set and seek to maximize collective payoff…

All Form

Reducing Optimism Bias in Incomplete Cooperative Games

2024-02-02 · Filip Úradník, David Sychrovský, Jakub Černý, Martin Černý

Cooperative game theory has diverse applications in contemporary artificial intelligence, including domains like interpretable machine learning, resource allocation, and collaborative decision-making. However, specifying…

Decision Making Interpretable Machine Learning

Reinforcement Learning for Finite Space Mean-Field Type Games

2024-09-25 · Kai Shao, Jiacheng Shen, Chijie An, Mathieu Laurière

Mean field type games (MFTGs) describe Nash equilibria between large coalitions: each coalition consists of a continuum of cooperative agents who maximize the average reward of their coalition while interacting non-coope…

Deep Reinforcement Learning Q-Learning Quantization reinforcement-learning+1

Exit-and-Join Dynamics and Equilibrium in Continuum Cooperative Games

2026-06-27 · Quanyan Zhu arxiv

This paper develops a continuum theory of exit-and-join coalition dynamics in nonatomic cooperative games. We extend the Aumann-Shapley value and the Aumann-Drèze value to coalition structures in which each coalition is …

Fast Algorithms for Game-Theoretic Centrality Measures

2015-12-06 · Piotr Lech Szczepański

In this dissertation, we analyze the computational properties of game-theoretic centrality measures. The key idea behind game-theoretic approach to network analysis is to treat nodes as players in a cooperative game, whe…