Simple games on closure spaces
A game on a closure space \(L\subseteq 2^{N}\) where \(N\) is a finite set is a real function \(v:L\rightarrow R\) such that \(v(\emptyset)=0.\) The authors assume that the games are simple and monotonic. After defining the closure spaces and convex geometries, some of their properties are described. Let \(\Gamma(L)\) denotes the vector space of all games on \(L\) and \(v\in L\) be a simple game. Under the appropriate assumption on \(L,\) the authors show that \(v\) is supermodular if and only if the game \(v\) is a unanimity game and the core\((L,v)\) is a stable set if and only if the game \(v\) is a unanimity game. Further, it is also shown that \(v\) is weak if and only if \(\text{core}(L,v)\neq \emptyset\) and each imputation that satisfies the dummy axiom is an element of the Weber set.
- An order-theoretic framework for the greedy algorithm with applications to the core and Weber set of cooperative games
- Axiomatizations of the conjunctive permission value for games with permission structures
- Global games
- Graphs and Cooperation in Games
- Hierarchical organization structures and constraints on coalition formation
- On the Position Value for Communication Situations
- The core of games on convex geometries
- The Shapley value for cooperative games under precedence constraints
- The Shapley value on convex geometries
- The theory of convex geometries
This page was built for publication: Simple games on closure spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1592627)
