Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

63

CORR
2011
Springer

122views Education» more CORR 2011»

Computability of simple games: A complete investigation of the sixty-four possibilities

14 years 10 months ago

Computability of simple games: A complete investigation of the sixty-four possibilities

Download mpra.ub.uni-muenchen.de

Masahiro Kumabe, H. Reiju Mihara

Real-time Traffic

CORR 2011 | Education |

claim paper

Related Content

» Behaviour realism and immersion in games

» Reachability Games and Game Semantics Comparing Nondeterministic Programs

» The Parametrized Probabilistic FiniteState Transducer Probe Game Player Fingerprint Model

» Learning to play Tetris applying reinforcement learning methods

» Static experts and dynamic enemies in coevolutionary games

» On time versus size for monotone dynamic monopolies in regular topologies

» A New Perspective on Multiuser Power Control Games in Interference Channels

» Alternatingtime temporal logic with explicit strategies

» Trust Is in the Eye of the Beholder

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Masahiro Kumabe, H. Reiju Mihara

Comments (0)