We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
Lance Fortnow, Russell Impagliazzo, Valentine Kaba...
An examination of the contributions that can be made by the field of non-mechanistic cybernetics (as elaborated by Gregory Bateson and Anthony Wilden) to a theory of videogames th...
This paper presents the mechanisms proposed by a generic cognitive architecture for virtual characters with emotional influenced behaviors, called cognitiva, to maintain behavior ...
Academic conferences provide a social space for people to present their work, learn about others’ work, and interact informally with one another. However, opportunities for inte...
Joseph F. McCarthy, David W. McDonald, Suzanne Sor...
Today’s web is so huge and diverse that it arguably reflects the real world. For this reason, searching the web is a promising approach to find things in the real world. This ...