The following pages link to Hugo Gimbert (Q259584):
Displaying 39 items.
- On values of repeated games with signals (Q259588) (← links)
- Randomness for free (Q897644) (← links)
- Two-sided matching markets with strongly correlated preferences (Q2140473) (← links)
- Stamina: stabilisation monoids in automata theory (Q2399252) (← links)
- Deciding Maxmin Reachability in Half-Blind Stochastic Games (Q2819447) (← links)
- (Q2849559) (← links)
- Subgame Perfection for Equilibria in Quantitative Reachability Games (Q2892777) (← links)
- BLACKWELL OPTIMAL STRATEGIES IN PRIORITY MEAN-PAYOFF GAMES (Q2909224) (← links)
- Two Recursively Inseparable Problems for Probabilistic Automata (Q2922022) (← links)
- Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes (Q2938106) (← links)
- Deciding the value 1 problem for probabilistic leaktight automata (Q2941760) (← links)
- Deciding the Value 1 Problem for Probabilistic Leaktight Automata (Q2986806) (← links)
- (Q3086927) (← links)
- Solving Simple Stochastic Games (Q3507435) (← links)
- Randomness for Free (Q3586088) (← links)
- Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata (Q3587426) (← links)
- Probabilistic Automata on Finite Words: Decidable and Undecidable Problems (Q3587465) (← links)
- Pure Stationary Optimal Strategies in Markov Decision Processes (Q3590933) (← links)
- Deterministic Priority Mean-Payoff Games as Limits of Discounted Games (Q3591411) (← links)
- Solving Simple Stochastic Games with Few Random Vertices (Q3636809) (← links)
- (Q4599518) (← links)
- Qualitative Determinacy and Decidability of Stochastic Games with Signals (Q4640298) (← links)
- On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games (Q4913770) (← links)
- (Q5009427) (← links)
- Distributed Asynchronous Games With Causal Memory are Undecidable (Q5043589) (← links)
- (Q5111438) (← links)
- (Q5111624) (← links)
- (Q5136322) (← links)
- (Q5150996) (← links)
- (Q5227518) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311141) (← links)
- Computer Science Logic (Q5311285) (← links)
- Asynchronous Games over Tree Architectures (Q5327440) (← links)
- Perfect-Information Stochastic Mean-Payoff Parity Games (Q5410674) (← links)
- (Q5417672) (← links)
- Perfect Information Stochastic Priority Games (Q5428864) (← links)
- Simple Stochastic Games with Few Random Vertices Are Easy to Solve (Q5458347) (← links)
- CONCUR 2005 – Concurrency Theory (Q5897499) (← links)
- Submixing and shift-invariant stochastic games (Q6183353) (← links)
