406 search results - page 8 / 82 » Games with Opacity Condition |
CAV
2007
Springer
14 years 1 months ago
2007
Springer
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
VSGAMES
2010
13 years 5 months ago
2010
—Games, and serious games especially, revolve around learning new material and integrating this into a mental model. However, playing games can be cognitively demanding and novic...
UAI
2004
13 years 8 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
TARK
1998
Springer
13 years 11 months ago
1998
Springer
We develop a revealed-preferencetheory for multiple agents. Some features of our construction, which draws heavily on Jeffrey's utility theory and on formal constructions by D...
AAAI
2006
13 years 9 months ago
2006
We analyze the asymptotic behavior of agents engaged in an infinite horizon partially observable stochastic game as formalized by the interactive POMDP framework. We show that whe...