Sciweavers

279 search results - page 7 / 56
» Timed Concurrent Game Structures
Sort
View
JACM
2007
160views more  JACM 2007»
13 years 7 months ago
Lossless abstraction of imperfect information games
abstraction of imperfect information games ANDREW GILPIN and TUOMAS SANDHOLM Computer Science Department Carnegie Mellon University Pittsburgh, PA, USA Finding an equilibrium of an...
Andrew Gilpin, Tuomas Sandholm
DIGRA
2005
Springer
14 years 1 months ago
The Pervasive Interface; Tracing the Magic Circle
This paper is an addition to the discourse surrounding interface theory and pervasive games. A buzzword by nature, the term ´interface´ needs to be investigated and redefined in...
Eva Nieuwdorp
REX
1993
13 years 11 months ago
Relationships Between Models of Concurrency
Abstract. Models for concurrency can be classified with respect to three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling...
Mogens Nielsen, Vladimiro Sassone, Glynn Winskel
SRDS
2000
IEEE
13 years 12 months ago
Detection of Livelocks in Communication Protocols by Means of a Polygon Time Structure
As has been shown, the polygon time structure overcomes the main limitations of the interval time structure, and allows to verify communication protocols, in which the explicit co...
Jerzy Brzezinski, Michal Sajkowski
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
14 years 1 months ago
Finding equilibria in large sequential games of imperfect information
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
Andrew Gilpin, Tuomas Sandholm