NP-completeness of some problems concerning voting games
International Journal of Game Theory
On the complexity of cooperative solution concepts
Mathematics of Operations Research
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory
NP-completeness for calculating power indices of weighted majority games
Theoretical Computer Science
Power and stability in connectivity games
Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 2
Power in threshold network flow games
Autonomous Agents and Multi-Agent Systems
Easy and hard coalition resource game formation problems: a parameterized complexity analysis
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
The cost of stability in weighted voting games
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Power Indices in Spanning Connectivity Games
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Computational complexity of weighted threshold games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On agent types in coalition formation problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
Parameterized Complexity
Hi-index | 0.00 |
In this paper we motivate a new approach to analyse the computational complexity of solution concepts and player-based properties, as well as other properties of coalitional games. This approach is based on the idea to abstract away from detailed game representations to analyse games via standard complexity proofs, towards a more abstract approach, where games are analysed by focusing on influential characteristics of related games. The core of this structure-centered perspective on coalitional games is to determine and systematically analyse promising characteristics, so that they can be used later to analyse games of a similar type. This may be particularly interesting in a well-restricted class of games, like in the context of networks. To give a first example of this approach, we concentrate on a specific type of game, namely graph-based games. In the course of our analysis we will provide various results for shortest path games, results also interesting for their own sake.