800 search results - page 102 / 160 » On the Complexity of Parity Games |
SIGECOM
2003
ACM
14 years 2 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
GI
2003
Springer
14 years 2 months ago
2003
Springer
: Strategic Simulation Games have become an important element of policy development in the context of Critical Infrastructure Protection (CIP). They foster the network between all ...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
ACG
2009
Springer
14 years 3 months ago
2009
Springer
Evaluating agents in decision-making applications requires assessing their skill and predicting their behaviour. Both are well developed in Poker-like situations, but less so in mo...
ATAL
2006
Springer
14 years 26 days ago
2006
Springer
We consider PAC learning of simple cooperative games, in which the coalitions are partitioned into "winning" and "losing" coalitions. We analyze the complexity...