 | 2008 |
|---|
| 13 |       | Hugo Gimbert,
Florian Horn:
Solving Simple Stochastic Games.
CiE 2008: 206-209 |
| 12 | | Hugo Gimbert,
Florian Horn:
Simple Stochastic Games with Few Random Vertices Are Easy to Solve.
FoSSaCS 2008: 5-19 |
| 11 | | Nathalie Bertrand,
Blaise Genest,
Hugo Gimbert:
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
CoRR abs/0811.3975: (2008) |
| 10 | | Florian Horn,
Hugo Gimbert:
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
CoRR abs/0811.3978: (2008) |
| 2007 |
|---|
| 9 | | Hugo Gimbert,
Wieslaw Zielonka:
Perfect Information Stochastic Priority Games.
ICALP 2007: 850-861 |
| 8 | | Hugo Gimbert,
Wieslaw Zielonka:
Limits of Multi-Discounted Markov Decision Processes.
LICS 2007: 89-98 |
| 7 | | Hugo Gimbert:
Pure Stationary Optimal Strategies in Markov Decision Processes.
STACS 2007: 200-211 |
| 6 | | Hugo Gimbert,
Florian Horn:
Solving Simple Stochastic Games with Few Random Vertices
Logical Methods in Computer Science 5(2): (2007) |
| 2006 |
|---|
| 5 | | Hugo Gimbert,
Wieslaw Zielonka:
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games.
ICALP (2) 2006: 312-323 |
| 2005 |
|---|
| 4 | | Hugo Gimbert,
Wieslaw Zielonka:
Games Where You Can Play Optimally Without Any Memory.
CONCUR 2005: 428-442 |
| 3 | | Hugo Gimbert,
Wieslaw Zielonka:
Discounting Infinite Games But How and Why?
Electr. Notes Theor. Comput. Sci. 119(1): 3-9 (2005) |
| 2004 |
|---|
| 2 | | Hugo Gimbert:
Parity and Exploration Games on Infinite Graphs.
CSL 2004: 56-70 |
| 1 | | Hugo Gimbert,
Wieslaw Zielonka:
When Can You Play Positionally?
MFCS 2004: 686-697 |
