49 search results - page 4 / 10 » Game theoretic Golog under partial observability |
MFCS
2010
Springer
13 years 4 months ago
2010
Springer
We address the strategy problem for ω-regular two-player games with partial information, played on finite game graphs. We consider two different kinds of observability on a gene...
JAIR
2008
13 years 5 months ago
2008
We present exact algorithms for identifying deterministic-actions' effects and preconditions in dynamic partially observable domains. They apply when one does not know the ac...
INFOCOM
2009
IEEE
14 years 12 days ago
2009
IEEE
— Security breaches and attacks are critical problems in today’s networking. A key-point is that the security of each host depends not only on the protection strategies it choo...
CORR
2011
Springer
13 years 23 days ago
2011
Springer
We provide a necessary and sufficient condition under which a convex set is approachable in a game with partial monitoring, i.e. where players do not observe their opponents’ mo...
MFCS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We address the strategy problem for parity games with partial information and observable colors, played on finite graphs of bounded graph complexity. We consider several...