Sciweavers

14084 search results - page 111 / 2817
» A Theory for Game Theories
Sort
View
STOC
1994
ACM
168views Algorithms» more  STOC 1994»
14 years 7 days ago
Fast algorithms for finding randomized strategies in game trees
Interactions among agents can be conveniently described by game trees. In order to analyze a game, it is important to derive optimal (or equilibrium) strategies for the di erent p...
Daphne Koller, Nimrod Megiddo, Bernhard von Stenge...
CHI
2004
ACM
14 years 1 months ago
The untapped world of video games
Due to fierce industry competition and demand for novelty, games are a fertile research setting for studying interface design, input devices, graphics, social communication and de...
Kevin Keeker, Randy J. Pagulayan, Jonathan Sykes, ...
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 8 months ago
The complexity of solving reachability games using value and strategy iteration
Concurrent reachability games is a class of games heavily studied by the computer science community, in particular by the formal methods community. Two standard algorithms for app...
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, P...
ISIPTA
2005
IEEE
130views Mathematics» more  ISIPTA 2005»
14 years 1 months ago
No Double Counting Semantics for Conditional Independence
The main goal of this paper is to describe a new semantic for conditional independence in terms of no double counting of uncertain evidence. For ease of exposition, we use probabi...
Prakash P. Shenoy
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
14 years 8 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy