ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
From MaRDI portal
Recommendations
- Values of Graph-Restricted Games
- Game values and computational complexity: an analysis via black-white combinatorial games
- scientific article; zbMATH DE number 1342211
- Mathematical Foundations of Computer Science 2005
- On the complexity of problems on simple games
- On Complexity of Ehrenfeucht-Fraïssé Games
- On complexity of Ehrenfeucht-Fraïssé games
- The complexity of recursion theoretic games
Cites work
- -component additive games
- A value with incomplete communication
- Games with permission structures: The conjunctive approach
- Graphs and Cooperation in Games
- On the Position Value for Communication Situations
- The Shapley value for cooperative games under precedence constraints
- The theory of convex geometries
- Values of Graph-Restricted Games
Cited in
(10)- Axiomatizations of the Shapley value for games on augmenting systems
- The cg-position value for games on fuzzy communication structures
- Algorithms for computing the Shapley value of cooperative games on lattices
- The cg-average tree value for games on cycle-free fuzzy communication structures
- A value for games restricted by augmenting systems
- On the Complexity of Non-reversible Betting Games on Many-Valued Events
- Restricted Power - Computational Complexity Results for Strategic Defense Games
- Values of Graph-Restricted Games
- Computational complexity of a solution for directed graph cooperative games
- Cooperative Games under Augmenting Systems
This page was built for publication: ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021974)
