1299 search results - page 105 / 260 » Quantitative Simulation Games |
156
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
When exploring a game over a large strategy space, it may not be feasible or cost-effective to evaluate the payoff of every relevant strategy profile. For example, determining a p...
128
Voted
AGI
2008
15 years 5 months ago
2008
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
116
Voted
UAI
2008
15 years 5 months ago
2008
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
144
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We develop a general game-theoretic framework for reasoning about strategic agents performing possibly costly computation. In this framework, many traditional game-theoretic resul...
129
Voted
ACSC
2004
IEEE
15 years 7 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...