Hugo Gimbert

According to our database1, Hugo Gimbert authored at least 54 papers between 2004 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Submixing and shift-invariant stochastic games.
Int. J. Game Theory, December, 2023

Games on Graphs.
CoRR, 2023

Rhoban Football Club: RoboCup Humanoid Kid-Size 2023 Champion Team Paper.
Proceedings of the RoboCup 2023: Robot World Cup XXVI [Bordeaux, France, 4-10 July, 2023]., 2023

2022
Distributed Asynchronous Games With Causal Memory are Undecidable.
Log. Methods Comput. Sci., 2022

Distributed Controller Synthesis for Deadlock Avoidance.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Constrained School Choice with Incomplete Information.
CoRR, 2021

Two-Sided Matching Markets with Strongly Correlated Preferences.
Proceedings of the Fundamentals of Computation Theory - 23rd International Symposium, 2021

2020
A Bridge between Polynomial Optimization and Games with Imperfect Recall.
Proceedings of the 19th International Conference on Autonomous Agents and Multiagent Systems, 2020

2019
Controlling a population.
Log. Methods Comput. Sci., 2019

On popularity-based random matching markets.
CoRR, 2019

2018
Alternating Nonzero Automata.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Qualitative Determinacy and Decidability of Stochastic Games with Signals.
J. ACM, 2017

A short proof of correctness of the quasi-polynomial time algorithm for parity games.
CoRR, 2017

Stamina: Stabilisation Monoids in Automata Theory.
Proceedings of the Implementation and Application of Automata, 2017

Emptiness of Zero Automata Is Decidable.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

On the Control of Asynchronous Automata.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

Controlling a Population.
Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016
Online Reinforcement Learning for Real-Time Exploration in Continuous State and Action Markov Decision Processes.
CoRR, 2016

Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences.
CoRR, 2016

A Class of Zielonka Automata with a Decidable Controller Synthesis Problem.
CoRR, 2016

Deciding Maxmin Reachability in Half-Blind Stochastic Games.
Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015
Randomness for free.
Inf. Comput., 2015

Deciding the value 1 problem for probabilistic leaktight automata.
Log. Methods Comput. Sci., 2015

A Fully Autonomous Robot for Putting Posts for Trellising Vineyard with Centimetric Accuracy.
Proceedings of the 2015 IEEE International Conference on Autonomous Robot Systems and Competitions, 2015

2014
On the values of repeated games with signals.
CoRR, 2014

Two-Player Perfect-Information Shift-Invariant Submixing Stochastic Games Are Half-Positional.
CoRR, 2014

Deciding the Value 1 Problem for $\sharp$ -acyclic Partially Observable Markov Decision Processes.
Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Two Recursively Inseparable Problems for Probabilistic Automata.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Perfect-Information Stochastic Mean-Payoff Parity Games.
Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013
An experiment of low cost entertainment robotics.
Proceedings of the IEEE International Symposium on Robot and Human Interactive Communication, 2013

Asynchronous Games over Tree Architectures.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
On Subgame Perfection in Quantitative Reachability Games
Log. Methods Comput. Sci., 2012

Deciding the Value 1 Problem for Probabilistic Leaktight Automata.
Proceedings of the 27th Annual IEEE Symposium on Logic in Computer Science, 2012

Subgame Perfection for Equilibria in Quantitative Reachability Games.
Proceedings of the Foundations of Software Science and Computational Structures, 2012

2011
A Class of Probabilistic Automata with a Decidable Value 1 Problem
CoRR, 2011

Pushing undecidability of the isolation problem for probabilistic automata
CoRR, 2011

2010
Blackwell-Optimal Strategies in Priority Mean-Payoff Games
Proceedings of the Proceedings First Symposium on Games, 2010

Solving Simple Stochastic Tail Games.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Probabilistic Automata on Finite Words: Decidable and Undecidable Problems.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009
Solving Simple Stochastic Games with Few Random Vertices
, 2009

2008
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
CoRR, 2008

Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides
CoRR, 2008

Simple Stochastic Games with Few Random Vertices Are Easy to Solve.
Proceedings of the Foundations of Software Science and Computational Structures, 2008

Solving Simple Stochastic Games.
Proceedings of the Logic and Theory of Algorithms, 2008

Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted games.
Proceedings of the Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]., 2008

2007
Pure Stationary Optimal Strategies in Markov Decision Processes.
Proceedings of the STACS 2007, 2007

Limits of Multi-Discounted Markov Decision Processes.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

Perfect Information Stochastic Priority Games.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2006
Deterministic Priority Mean-Payoff Games as Limits of Discounted Games.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Games Where You Can Play Optimally Without Any Memory.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Discounting Infinite Games But How and Why?
Proceedings of the Workshop on Games in Design and Verification, 2004

When Can You Play Positionally?
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Parity and Exploration Games on Infinite Graphs.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004


  Loading...