Sciweavers

230 search results - page 36 / 46
» UPPAAL-Tiga: Time for Playing Games!
Sort
View
CONCUR
2010
Springer
13 years 8 months ago
Obliging Games
Abstract. Graph games of infinite length provide a natural model for open reactive systems: one player (Eve) represents the controller and the other player (Adam) represents the en...
Krishnendu Chatterjee, Florian Horn, Christof L&ou...
SAGT
2010
Springer
164views Game Theory» more  SAGT 2010»
13 years 5 months ago
On Nash-Equilibria of Approximation-Stable Games
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
Pranjal Awasthi, Maria-Florina Balcan, Avrim Blum,...
AIM
1998
13 years 7 months ago
Computer Bridge - A Big Win for AI Planning
A computer program that uses AI planning techniques is now the world’s best program for the game of contract bridge. As reported in The New York Times and The Washington Post, t...
Stephen J. J. Smith, Dana S. Nau, Thomas A. Throop
MM
2004
ACM
130views Multimedia» more  MM 2004»
14 years 25 days ago
An approach to interactive media system for mobile devices
The interactive system which interacts human with computer has been recognized as one direction of computer development for a long time. For example, in cinema, a person gets info...
Eun-Seok Ryu, Chuck Yoo
CORR
2008
Springer
137views Education» more  CORR 2008»
13 years 7 months ago
On the Complexity of Nash Equilibria of Action-Graph Games
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
Constantinos Daskalakis, Grant Schoenebeck, Gregor...