Sciweavers

800 search results - page 20 / 160
» On the Complexity of Parity Games
Sort
View
COGSCI
2004
53views more  COGSCI 2004»
13 years 9 months ago
On the spontaneous discovery of a mathematical relation during problem solving
People spontaneously discover new representations during problem solving. Discovery of a mathematical representation is of special interest, because it shows that the underlying s...
James A. Dixon, Ashley S. Bangert
SAGT
2009
Springer
112views Game Theory» more  SAGT 2009»
14 years 4 months ago
On the Complexity of Iterated Weak Dominance in Constant-Sum Games
Abstract. In game theory, a player’s action is said to be weakly dominated if there exists another action that, with respect to what the other players do, is never worse and some...
Felix Brandt, Markus Brill, Felix A. Fischer, Paul...
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
14 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
AAAI
2008
13 years 12 months ago
On the Dimensionality of Voting Games
In a yes/no voting game, a set of voters must determine whether to accept or reject a given alternative. Weighted voting games are a well-studied subclass of yes/no voting games, ...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...
FDG
2009
ACM
14 years 4 months ago
Motion and scene complexity for streaming video games
This work provides detailed measurements of the motion and scene complexity for a wide variety of video games. Novel algorithms to measure motion and scene complexity are presente...
Mark Claypool