Nombre de documents

44

CV de Hugo Gimbert


Rapport3 documents

  • Hugo Gimbert, Edon Kelmendi. Note: On A Proof Of Positionality Of Mean-Payoff Stochastic Games. [Research Report] Université de Bordeaux, LaBRI. 2014. <hal-01091192>
  • Hugo Gimbert, Youssouf Oualhadj. Deciding the Value 1 Problem for #-acyclic Partially Observable Markov Decision Processes. 2012. <hal-00743137v3>
  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj. Stochastic Games with Parity Mean-payoff Objective. 2012. <hal-00766251>

Pré-publication, Document de travail10 documents

  • Edon Kelmendi, Hugo Gimbert. Deciding Maxmin Reachability in Half-Blind Stochastic Games. 2016. <hal-01320391>
  • Hugo Gimbert, Edon Kelmendi. Two-Player Perfect-Information Shift-Invariant Submixing Stochastic Games Are Half-Positional. 2014. <hal-00936371v2>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. 2013. <hal-00684223v3>
  • Hugo Gimbert, Youssouf Oualhadj, Soumya Paul. Computing Optimal Strategies for Markov Decision Processes with Parity and Positive-Average Conditions. 2011. <hal-00559173v3>
  • Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj. Pushing undecidability of the isolation problem for probabilistic automata. 2011. <hal-00585840>
  • Hugo Gimbert. Randomized Strategies are Useless in Markov Decision Processes. 2009. <hal-00403463v4>
  • Hugo Gimbert, Florian Horn. Solving Simple Stochastic Games with Few Random Vertices. 2009. <hal-00195914v4>
  • Hugo Gimbert, Wieslaw Zielonka. Pure and Stationary Optimal Strategies in Perfect-Information Stochastic Games with Global Preferences. 2009. <hal-00438359v2>
  • Nathalie Bertrand, Blaise Genest, Hugo Gimbert. Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides. 2008. <hal-00341288>
  • Hugo Gimbert, Florian Horn. Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions. 2008. <hal-00341289v2>

Communication dans un congrès25 documents

  • Ludovic Hofer, Hugo Gimbert. Online Reinforcement Learning for Real-Time Exploration in Continuous State and Action Markov Decision Processes. PlanRob 4th, Workshop of ICAPS 26th, Jun 2016, Londres, United Kingdom. 2016. <hal-01416179>
  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Youssouf Oualhadj. Perfect-Information Stochastic Mean-Payoff Parity Games. FOSSACS 2014, Apr 2014, Grenoble, France. pp.210-225, 2014, <10.1007/978-3-642-54830-7_14>. <hal-01006391>
  • Hugo Gimbert, Youssouf Oualhadj. Deciding the Value 1 Problem for sharp-acyclic Partially Observable Markov Decision Processes. SOFSEM 2014, Jan 2014, Nový Smokovec, Slovakia. pp.281-292, 2014, <10.1007/978-3-319-04298-5_25>. <hal-01006394>
  • Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj. Two Recursively Inseparable Problems for Probabilistic Automata. MFCS 2014, Aug 2014, Budapest, Hungary. Paper 168, 2014. <hal-01007706>
  • Paul Fudal, Hugo Gimbert, Loic Gondry, Ludovic Hofer, Olivier Ly, et al.. An experiment of low cost entertainment robotics. RO-MAN 2013, Aug 2013, France. pp.820 - 825, 2013, <10.1109/ROMAN.2013.6628414>. <hal-01006397>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Asynchronous Games over Tree Architectures. Fomin, Fedor V. and Freivalds, Rūsiņš and Kwiatkowska, Marta and Peleg, David. ICALP - 40th International Colloquium on Automata, Languages, and Programming- 2013, Jul 2013, RIGA, Latvia. Springer, 7966, pp.275-286, 2013, LNCS; ICALP - 40th International Colloquium on Automata, Languages, and Programming- 2013 (Part II). <10.1007/978-3-642-39212-2_26>. <hal-00916615>
  • Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert. Subgame Perfection for Equilibria in Quantitative Reachability Games. FOSSACS 2012, Mar 2012, Talinn, Estonia. pp.286-300, 2012. <hal-01006403>
  • Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj. Deciding the Value 1 Problem of Probabilistic Leaktight Automata. Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on, Jun 2012, Croatia. pp.295-304, 2012, <10.1109/LICS.2012.40>. <hal-00585835v5>
  • Hugo Gimbert, Florian Horn. Solving Simple Stochastic Tail Games. SODA'10 (Symposium on Discrete Algorithms), Jan 2010, Austin, United States. pp.1000, 2010. <hal-00413430>
  • Krishnendu Chatterjee, Laurent Doyen, Hugo Gimbert, Thomas Henzinger. Randomness for Free. Petr Hliněný and Antonín Kučera. MFCS 2010 - 35th International Symposium on Mathematical Foundations of Computer Science, Aug 2010, Brno, Czech Republic. Springer, 6281, pp.246-257, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-15155-2_23>. <hal-01006409>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. ICALP, 2010, France. 6199, pp.52-63, 2010, LNCS. <hal-00536788>
  • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata. International Conference on AUTOMATA, LANGUAGES AND PROGRAMMING, 2010, France. pp.52-63, 2010. <hal-00672834>
  • Hugo Gimbert, Youssouf Oualhadj. Probabilistic Automata on Finite words: Decidable and Undecidable Problems. ICALP 2010, Jul 2010, Bordeaux, France. pp.527-538, 2010, <10.1007/978-3-642-14162-1_44>. <hal-00456538v3>
  • Nathalie Bertrand, Blaise Genest, Hugo Gimbert. Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS'09, IEEE Symposium on logic in computer science, Aug 2009, Los Angeles, United States. pp.0, 2009. <hal-00356566>
  • Hugo Gimbert, Florian Horn. Simple Stochastic Games with Few Random Vertices are Easy to Solve. FOSSACS, Mar 2009, France. pp.5-19, 2008, <10.1007/978-3-540-78499-9>. <hal-00343656>
  • Hugo Gimbert, Florian Horn. Solving Simple Stochastic Games. Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe. CIE 2008, Jun 2008, France. Springer, 5028, pp.206/209, LNCS. <10.1007/978-3-540-69407-6_24>. <hal-00344228>
  • Hugo Gimbert. Pure Stationary Optimal Strategies in Markov Decision Processes. Wolfgang Thomas and Pascal Weil. STACS 2007, May 2007, Aachen, Germany. Springer Berlin / Heidelberg, pp.200-211, 2007, <10.1007/978-3-540-70918-3_18>. <hal-00140144>
  • Hugo Gimbert, Wieslaw Zielonka. Limits of Multi-Discounted Markov Decision Processes. LICS 07, Jul 2007, Wroclaw, Poland. IEEE, pp.89-98, 2007, <10.1109/LICS.2007.28>. <hal-00140148>
  • Hugo Gimbert, Wieslaw Zielonka. Perfect Information Stochastic Priority Games. ICALP 07, Jul 2007, Wroclaw, Poland. pp.850-861, 2007, <10.1007/978-3-540-73420-8_73>. <hal-00140150>
  • Hugo Gimbert, Wieslaw Zielonka. Deterministic Priority Mean-payoff Games as Limits of Discounted Games. M. Bugliesi, B. Preneel, V. Sassone, I. Wegener. Automata, Languages and Programming, Jul 2006, Venice, Italy. Springer, Berlin, pp.312-323, 2006, Lecture Notes in Comp. Sci. 4051. <10.1007/11787006_27>. <hal-00160434>
  • Hugo Gimbert, Wieslaw Zielonka. Deterministic priority mean-payoff games as limits of discounted games. ICALP 06, Jun 2006, Venise, Italy. Springer Berlin / Heidelberg, pp.312-323, 2006, <10.1007/11787006_27>. <hal-00140133>
  • Hugo Gimbert, Wieslaw Zielonka. Games where you can play optimally without any memory. M. Abadi and L. de Alfaro. CONCUR 2005, 2005, San Francisco, United States. Springer, pp.428-442, 2005, Lecture Notes in Comp. Sci. 3653. <hal-00160435>
  • Hugo Gimbert, Wieslaw Zielonka. When can you play positionnaly?. I. Fiala and V. Koubek and J. Kratochvil. Mathematical Foundations of Computer Science 2004, 2004, Prague, Czech Republic. Springer, pp.686-697, 2004, Lecture Notes in Comp. Sci. 3153. <hal-00160436>
  • Wieslaw Zielonka, Hugo Gimbert. Discounting Infinite Games But How and Why?. L. de Alfaro. Workshop on Games in Design and Verification (GDV 2004), 2004, United States. Elsevier, pp.3-9, 2004, Electronic Notes in Theoretical Computer Science v.119(1). <10.1016/j.entcs.2004.07.005>. <hal-00160454>
  • Hugo Gimbert. Parity and Exploration Games on Infinite Graphs. Jerzy Marcinkowski and Andrzej Tarlecki. CSL 2004, Sep 2004, Karpacz, Poland. Springer Berlin / Heidelberg, pp.56-70, 2004, <10.1007/b100120>. <hal-00160739>

Autre publication1 document

  • Hugo Gimbert, Youssouf Oualhadj. Automates probabilistes: problèmes décidables et indécidables. RR-1464-09. Rapport de Recherche RR-1464-09 LaBRI. 2009. <hal-00422888>

Article dans une revue5 documents

  • Hugo Gimbert, Jérôme Renault, Sylvain Sorin, Xavier Venel, Wieslaw Zielonka. On the values of repeated games with signals. The Annals of Applied Probability : an official journal of the institute of mathematical statistics, The Institute of Mathematical Statistics, 2016, <10.1214/14-AAP1095>. <hal-01006951>
  • Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj. Deciding the value 1 problem for probabilistic leaktight automata. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2015, pp.37. <http://lmcs-online.org/>. <10.2168/LMCS-2014-994>. <hal-01140262>
  • Thomas Brihaye, Véronique Bruyère, Julie De Pril, Hugo Gimbert. On Subgame Perfection in Quantitative Reachability Games. Logical Methods in Computer Science, Logical Methods in Computer Science Association, 2013, Paper 7. <10.2168/LMCS-9(1:7)2013>. <hal-01006399>
  • Hugo Gimbert, Wieslaw Zielonka. Blackwell Optimal Strategies in Priority Mean-Payoff Games. International Journal of Foundations of Computer Science, World Scientific Publishing, 2012, 23 (03), pp.687-711. <10.1142/S0129054112400345>. <hal-01006400>
  • Hugo Gimbert, Wieslaw Zielonka. Applying Blackwell optimality: priority mean-payoff games as limits of multi-discounted game. Texts in Logic and Games, 2007, 2, pp.331-356. <hal-00344222>