Sciweavers

322 search results - page 15 / 65
» Active Context-Free Games
Sort
View
AAAI
2008
13 years 11 months ago
Efficient Algorithms to Solve Bayesian Stackelberg Games for Security Applications
In a class of games known as Stackelberg games, one agent (the leader) must commit to a strategy that can be observed by the other agent (the adversary/follower) before the advers...
Praveen Paruchuri, Jonathan P. Pearce, Janusz Mare...
SIGMETRICS
2008
ACM
126views Hardware» more  SIGMETRICS 2008»
13 years 8 months ago
Characterizing multiparty voice communication for multiplayer games
Over the last few years, the number of game players using voice communication to talk to each other while playing games has increased dramatically. In fact, many modern games and ...
Gabor Papp, Chris GauthierDickey
FDG
2009
ACM
14 years 1 months ago
Can middle-schoolers use Storytelling Alice to make games?: results of a pilot study
In this paper we share experiences from two 2-week summer courses for middle-school students in game programming using Storytelling Alice (SA). The students spent 20 hours learnin...
Linda L. Werner, Jill Denner, Michelle Bliesner, P...
NETGAMES
2004
ACM
14 years 2 months ago
Zoned federation of game servers: a peer-to-peer approach to scalable multi-player online games
Today’s Multi-player Online Games (MOGs) are challenged by infrastructure requirements, because of their server-centric nature. Peer-to-peer networks are an interesting alternat...
Takuji Iimura, Hiroaki Hazeyama, Youki Kadobayashi
CORR
2012
Springer
229views Education» more  CORR 2012»
12 years 4 months ago
Cops and Invisible Robbers: the Cost of Drunkenness
We examine a version of the Cops and Robber (CR) game in which the robber is invisible, i.e., the cops do not know his location until they capture him. Apparently this game (CiR) h...
Athanasios Kehagias, Dieter Mitsche, Pawel Pralat