Sciweavers

1167 search results - page 15 / 234
» Relational Markov Games
Sort
View
83
Voted
JACM
2007
160views more  JACM 2007»
14 years 9 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
QEST
2005
IEEE
15 years 3 months ago
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
Roberto Segala, Andrea Turrini
IJCAI
2007
14 years 11 months ago
r-grams: Relational Grams
We introduce relational grams (r-grams). They upgrade n-grams for modeling relational sequences of atoms. As n-grams, r-grams are based on smoothed n-th order Markov chains. Smoot...
Niels Landwehr, Luc De Raedt
EUROSSC
2008
Springer
14 years 11 months ago
Using a Movable RFID Antenna to Automatically Determine the Position and Orientation of Objects on a Tabletop
Augmented tabletop games support players by sensing the context of game figures (i.e., position and/or orientation) and then using this information to display additional game infor...
Steve Hinske, Marc Langheinrich
SIGECOM
2006
ACM
135views ECommerce» more  SIGECOM 2006»
15 years 3 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