Cooperative games on simplicial complexes
From MaRDI portal
Publication:2208366
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 3139280 (Why is no real title available?)
- scientific article; zbMATH DE number 3908445 (Why is no real title available?)
- scientific article; zbMATH DE number 3558981 (Why is no real title available?)
- scientific article; zbMATH DE number 1099359 (Why is no real title available?)
- scientific article; zbMATH DE number 863503 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- scientific article; zbMATH DE number 3078997 (Why is no real title available?)
- A necessary and sufficient condition for the convexity in oligopoly games
- A system-theoretic model for cooperation, interaction and allocation
- A topological approach to evasiveness
- Analysis of regression in game theory approach
- Combinatorics and commutative algebra.
- Complexity of the Minimum Base Game on Matroids
- Constructions preserving evasiveness and collapsibility
- Cores of convex games
- Examples of \(\mathbb{Z}\)-acyclic and contractible vertex-homogeneous simplicial complexes
- Extreme points of the Harsanyi set and the Weber set
- Face module for realizable \(\mathbb{Z}\)-matroids
- Monotone Bipartite Graph Properties are Evasive
- Oriented Matroids
- Proportional coalition values for monotonic games on convex geometries with a coalition structure
- Random reduction consistency of the Weber set, the core and the anti-core
- Simplicial complexes and the evasiveness conjecture
- Some results related to the evasiveness conjecture.
- Super-modularity: Applications to convex games and to the greedy algorithm for LP
- Syzygies of the Veronese modules
- The Shapley value for games on matroids: the static model
- The core and the Weber set of games on augmenting systems
- The fuzzy core and Shapley function for dynamic fuzzy games on matroids
- The intermediate set and limiting superdifferential for coalitional games: between the core and the Weber set
- The shapley value for games on matroids: the dynamic model
- Vertex collapsing and cut ideals
Cited in
(10)- Games restricted by simplicial complexes and an application to vertiport cooperation
- Simplicial epidemic model with a threshold policy
- Cooperative games with a simplicial core
- Two-Level Cooperative Game on Hypergraph
- scientific article; zbMATH DE number 934599 (Why is no real title available?)
- Theorems on closed coverings of a simplex and their applications to cooperative game theory
- A value for cooperative games on simplicial complexes with a filtration
- Coordination games on graphs
- A noncooperative game on polyhedral sets
- Political structures and the topology of simplicial complexes
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)