Pages that link to "Item:Q3021974"
From MaRDI portal
The following pages link to ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES (Q3021974):
Displaying 9 items.
- Computational complexity of a solution for directed graph cooperative games (Q384201) (← links)
- Axiomatizations of the Shapley value for games on augmenting systems (Q1041948) (← links)
- The \(cg\)-position value for games on fuzzy communication structures (Q1795038) (← links)
- Algorithms for computing the Shapley value of cooperative games on lattices (Q1800390) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- The \(cg\)-average tree value for games on cycle-free fuzzy communication structures (Q2334469) (← links)
- On the Complexity of Non-reversible Betting Games on Many-Valued Events (Q3163975) (← links)
- Restricted Power - Computational Complexity Results for Strategic Defense Games (Q3305735) (← links)
- Values of Graph-Restricted Games (Q3796995) (← links)