1698 search results - page 108 / 340 » Growing Complex Games |
130
click to vote
GECCO
2005
Springer
15 years 9 months ago
2005
Springer
Relative fitness, or “evaluation by tests” is one of the building blocks of coevolution: the only fitness information available is a comparison with other individuals in a p...
142
click to vote
SIGECOM
2003
ACM
15 years 9 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...
170
click to vote
FSTTCS
2010
Springer
15 years 2 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...
143
click to vote
ACG
2009
Springer
15 years 10 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...
124
click to vote
ATAL
2006
Springer
15 years 7 months 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...