Sciweavers

1698 search results - page 27 / 340
» Growing Complex Games
Sort
View
TCS
2008
15 years 1 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
ATAL
2009
Springer
15 years 8 months ago
Constrained coalitional games: formal framework, properties, and complexity results
Gianluigi Greco, Enrico Malizia, Luigi Palopoli, F...
72
Voted
ESA
2005
Springer
76views Algorithms» more  ESA 2005»
15 years 7 months ago
The Complexity of Games on Highly Regular Graphs
Konstantinos Daskalakis, Christos H. Papadimitriou
ICALP
2005
Springer
15 years 7 months ago
The Complexity of Stochastic Rabin and Streett Games'
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...