Sciweavers

800 search results - page 46 / 160
» On the Complexity of Parity Games
Sort
View
SIGECOM
2010
ACM
173views ECommerce» more  SIGECOM 2010»
14 years 10 months ago
Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games
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....
Anand Bhalgat, Tanmoy Chakraborty, Sanjeev Khanna
CONCUR
2007
Springer
15 years 4 months ago
Strategy Logic
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...
Krishnendu Chatterjee, Thomas A. Henzinger, Nir Pi...
SIGCSE
2009
ACM
114views Education» more  SIGCSE 2009»
15 years 10 months ago
Engaging students through mobile game development
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...
Stan Kurkovsky
WG
2009
Springer
15 years 4 months ago
Distance d-Domination Games
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...
Stephan Kreutzer, Sebastian Ordyniak
MUM
2005
ACM
92views Multimedia» more  MUM 2005»
15 years 3 months ago
User experiences with mobile phone camera game interfaces
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...
Sam Bucolo, Mark Billinghurst, David Sickinger