Sciweavers

904 search results - page 83 / 181
» Game Theory
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
15 years 4 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
ACMACE
2007
ACM
15 years 8 months ago
Understanding social interaction in world of warcraft
Research has argued that social interaction is a primary driving force for gamers to continue to play Massive Multiple Online Role Playing Games (MMORPGs). However, one recent stu...
Vivian Hsueh-hua Chen, Henry Been-Lirn Duh
STOC
2007
ACM
119views Algorithms» more  STOC 2007»
16 years 4 months ago
Balanced max 2-sat might not be the hardest
We show that, assuming the Unique Games Conjecture, it is NPhard to approximate MAX 2-SAT within LLZ + , where 0.9401 < LLZ < 0.9402 is the believed approximation ratio of t...
Per Austrin
177
Voted
HUC
2010
Springer
15 years 1 months ago
Propinquity: exploring embodied gameplay
Consumer game platforms are realizing Ubicomp's vision of seamless, sensor-based, embodied interaction with computation. Here we present Propinquity, a full-body dancing/figh...
Amanda Williams, Lynn Hughes, Bart Simon
ATAL
2009
Springer
15 years 10 months ago
False name manipulations in weighted voting games: splitting, merging and annexation
An important aspect of mechanism design in social choice protocols and multiagent systems is to discourage insincere and manipulative behaviour. We examine the computational compl...
Haris Aziz, Mike Paterson