800 search results - page 46 / 160 » On the Complexity of Parity Games |
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
Cut games and party affiliation games are well-known classes of potential games. Schaffer and Yannakakis showed that computing pure Nash equilibrium in these games is PLScomplete....
CONCUR
2007
Springer
14 years 3 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...
SIGCSE
2009
ACM
14 years 9 months ago
2009
ACM
This paper describes using mobile game development as a motivational tool to engage students early in the curriculum. Mobile devices have become an integral part of everyday lives...
WG
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. We study graph searching games where a number of cops try to capture a robber that is hiding in a system of tunnels modelled as a graph. While the current position of the...
MUM
2005
ACM
14 years 2 months ago
2005
ACM
This paper presents the findings of a comparative study investigating different input interfaces for a mobile phone games application. A standard mobile phone joystick interface i...