ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES

DOI10.1142/S0129054102001345zbMath1066.91008OpenAlexW2136523137MaRDI QIDQ3021974

J. J. López, Jésus Mario Bilbao, Julio R. Fernández

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001345

zbMATH Keywords

complexitycooperative gamesShapley valueBanzhaf value

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cooperative games (91A12) Games in extensive form (91A18)

Related Items (2)

The \(cg\)-position value for games on fuzzy communication structures ⋮ The \(cg\)-average tree value for games on cycle-free fuzzy communication structures

Cites Work

• The theory of convex geometries
• Games with permission structures: The conjunctive approach
• The Shapley value for cooperative games under precedence constraints
• A value with incomplete communication
• \(\Gamma\)-component additive games
• Values of Graph-Restricted Games
• On the Position Value for Communication Situations
• Graphs and Cooperation in Games

This page was built for publication: ON THE COMPLEXITY OF COMPUTING VALUES OF RESTRICTED GAMES