57 search results - page 4 / 12 » The Nakamura numbers for computable simple games |
ECCC
2006
13 years 8 months ago
2006
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
AIIDE
2008
13 years 11 months ago
2008
Game developers are faced with the difficult task of creating non-player characters with convincing behavior. This commonly involves an exhaustive specification of their actions i...
NETGAMES
2005
ACM
14 years 2 months ago
2005
ACM
We study the ‘background traffic’ resulting from tens of thousands of networked first person shooter (FPS) clients searching for servers on which to play. Networked, multiplay...
EDUTAINMENT
2007
Springer
14 years 2 months ago
2007
Springer
As many 3D on-line games appear, there is an increased need for simple and efficient techniques to create many new faces. This paper presents a new algorithm to composite 3D faces ...
ALT
2008
Springer
14 years 5 months ago
2008
Springer
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...