Cooperative games on simplicial complexes
From MaRDI portal
Publication:2208366
DOI10.1016/J.DAM.2020.08.035zbMATH Open1448.91016arXiv2001.00366OpenAlexW3089003193MaRDI QIDQ2208366FDOQ2208366
Authors: Ivan Martino
Publication date: 2 November 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract: In this work, we define cooperative games on simplicial complexes, generalizing the study of probabilistic values of Weber and quasi-probabilistic values of Bilbao, Driessen, Jim'{e}nez Losada and Lebr'{o}n. Applications to Multi-Touch Attribution and the interpretability of the Machine-Learning prediction models motivate these new developments. We deal with the axiomatization provided by the -dummy and the monotonicity requirements together with a probabilistic form of the symmetric and the efficiency axioms. We also characterize combinatorially the set of probabilistic participation influences as the facet polytope of the simplicial complex.
Full work available at URL: https://arxiv.org/abs/2001.00366
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Oriented Matroids
- Combinatorics and commutative algebra.
- Cores of convex games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Title not available (Why is that?)
- Title not available (Why is that?)
- A necessary and sufficient condition for the convexity in oligopoly games
- A topological approach to evasiveness
- Constructions preserving evasiveness and collapsibility
- The Shapley value for games on matroids: the static model
- Extreme points of the Harsanyi set and the Weber set
- A system-theoretic model for cooperation, interaction and allocation
- Examples of \(\mathbb{Z}\)-acyclic and contractible vertex-homogeneous simplicial complexes
- Analysis of regression in game theory approach
- Monotone Bipartite Graph Properties are Evasive
- The shapley value for games on matroids: the dynamic model
- Some results related to the evasiveness conjecture.
- The core and the Weber set of games on augmenting systems
- Title not available (Why is that?)
- Syzygies of the Veronese modules
- The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set
- Proportional coalition values for monotonic games on convex geometries with a coalition structure
- The fuzzy core and Shapley function for dynamic fuzzy games on matroids
- Face module for realizable \(\mathbb{Z}\)-matroids
- Complexity of the Minimum Base Game on Matroids
- Random reduction consistency of the Weber set, the core and the anti-core
- Title not available (Why is that?)
- Simplicial complexes and the evasiveness conjecture
- Vertex collapsing and cut ideals
Cited In (10)
- Coordination games on graphs
- A noncooperative game on polyhedral sets
- Two-Level Cooperative Game on Hypergraph
- Cooperative games with a simplicial core
- Simplicial epidemic model with a threshold policy
- Theorems on closed coverings of a simplex and their applications to cooperative game theory
- Political structures and the topology of simplicial complexes
- A value for cooperative games on simplicial complexes with a filtration
- Games restricted by simplicial complexes and an application to vertiport cooperation
- Title not available (Why is that?)
Uses Software
This page was built for publication: Cooperative games on simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2208366)