Sciweavers

1599 search results - page 45 / 320
» Algorithms for Parity Games
Sort
View
LOGCOM
2002
100views more  LOGCOM 2002»
14 years 11 months ago
Model Checking Games for Branching Time Logics
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
Martin Lange, Colin Stirling
ATAL
2007
Springer
15 years 5 months ago
An adaptive strategy for minority games
Many real life situations, like the financial market, auctions and resources competitions, can be modeled as Minority Games. In minority games, players choose to join one of the ...
Ka-man Lam, Ho-fung Leung
NOSSDAV
2005
Springer
15 years 4 months ago
Mitigating information exposure to cheaters in real-time strategy games
Cheating in on-line games is a prevalent problem for both game makers and players. The popular real-time strategy game genre is especially vulnerable to cheats, as it is frequentl...
Chris Chambers, Wu-chang Feng, Wu-chi Feng, Debanj...
ICCV
2009
IEEE
14 years 9 months ago
Quasi-periodic event analysis for social game retrieval
A new problem of retrieving social games from unstructured videos is proposed. Social games are characterized by repetitions (with variations) of alternating turns between two pla...
Ping Wang, Gregory D. Abowd, James M. Rehg
FUN
2010
Springer
251views Algorithms» more  FUN 2010»
15 years 4 months ago
UNO Is Hard, Even for a Single Player
UNOR is one of the world-wide well-known and popular card games. We investigate UNO from the viewpoint of combinatorial algorithmic game theory by giving some simple and concise ma...
Erik D. Demaine, Martin L. Demaine, Ryuhei Uehara,...