386 citations
- Slovak Academy of SciencesSK17 papers
- Uppsala UniversitySE9 papers
- Czech Academy of Sciences, Astronomical InstituteCZ6 papers
- Stony Brook UniversityUS6 papers
- Charles UniversityCZ5 papers
- Institute of Physics of the Slovak Academy of SciencesSK5 papers
- Max Planck Institute for Solid State ResearchDE5 papers
- P.N. Lebedev Physical Institute of the Russian Academy of SciencesRU5 papers
- Imperial College LondonGB4 papers
- University of EdinburghGB4 papers
- University of HelsinkiFI4 papers
- University of ViennaAT4 papers
Showing 2010 · cs.GTShow all
3 papers · 2 filters
cs.GT2010★ 2 cited
Using Strategy Improvement to Stay Alive
Luboš Brim, Jakub Chaloupka
We design a novel algorithm for solving Mean-Payoff Games (MPGs). Besides solving an MPG in the usual sense, our algorithm computes more information about the game, information tha…
cs.GT2010★ 37 cited
Qualitative Reachability in Stochastic BPA Games
Tomáš Brázdil, Václav Brožek, Antonín Kučera +1
We consider a class of infinite-state stochastic games generated by stateless pushdown automata (or, equivalently, 1-exit recursive state machines), where the winning objective is…
cs.GT2010
Reachability Games on Extended Vector Addition Systems with States
Tomas Brazdil, Petr Jancar, Antonin Kucera
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin…