Sciweavers

182 search results - page 1 / 37
» Information Tracking in Games on Graphs
Sort
View
JOLLI
2010
85views more  JOLLI 2010»
13 years 9 months ago
Information Tracking in Games on Graphs
Abstract. When seeking to coordinate in a game with imperfect information, it is often relevant for a player to know what other players know. Keeping track of the information acqui...
Dietmar Berwanger, Lukasz Kaiser
CSL
2010
Springer
13 years 12 months ago
Energy and Mean-Payoff Games with Imperfect Information
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
Aldric Degorre, Laurent Doyen, Raffaella Gentilini...
MFCS
2010
Springer
13 years 9 months ago
Parity Games with Partial Information Played on Graphs of Bounded Complexity
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...
Bernd Puchala, Roman Rabinovich
JCP
2007
118views more  JCP 2007»
13 years 10 months ago
Tutoring an Entire Game with Dynamic Strategy Graphs: The Mixed-Initiative Sudoku Tutor
Abstract— In this paper, we develop a mixed-initiative intelligent tutor for the game of Sudoku called MITS. We begin by developing a characterization of the strategies used in S...
Allan Caine, Robin Cohen
VMCAI
2009
Springer
14 years 5 months ago
Average-Price-per-Reward Games on Hybrid Automata with Strong Resets
We study price-per-reward games on hybrid automata with strong resets. They generalise priced games previously studied and have applications in scheduling. We obtain decidability r...
Marcin Jurdzinski, Ranko Lazic, Michal Rutkowski