Profil

Grandmont Christophe

Université de Mons - UMONS > Faculté des Sciences > Service d'Informatique théorique

ORCID
0009-0009-4573-0123
Main Referenced Co-authors
BRUYERE, Véronique  (1)
Raskin, Jean-François (1)
Main Referenced Keywords
Nash equilibrium (6); Pareto-optimality (6); Quantitative reachability objectives (6); Rational synthesis (6); Rational verification (6);
Main Referenced Disciplines
Computer science (9)
Mathematics (2)

Publications (total 9)

The most downloaded
15 downloads
Bruyère, V., Grandmont, C., & Raskin, J.-F. (29 August 2024). As Soon as Possible but Rationally. International Conference on Concurrency Theory (CONCUR), 311, 14:1--14:20. doi:10.4230/LIPIcs.CONCUR.2024.14 https://hdl.handle.net/20.500.12907/49581

The most significant

Bruyère, V., Grandmont, C., & Raskin, J.-F. (29 August 2024). As Soon as Possible but Rationally. International Conference on Concurrency Theory (CONCUR), 311, 14:1--14:20. doi:10.4230/LIPIcs.CONCUR.2024.14
Peer reviewed


Grandmont, C. (10 December 2024). Introduction aux Jeux sur Graphe à Préférence Automatique [Paper presentation]. Séminaire Jeunes, Mons, Belgium.

Grandmont, C. (21 October 2024). Automatic Relations: their Properties and Beyond [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium.

Grandmont, C. (19 September 2024). As Soon as Possible but Rationally: Rational Synthesis for Reachability on Weighted Graphs [Paper presentation]. Highlights of Logic, Games and Automata, Bordeaux, France.
Peer reviewed

Grandmont, C. (10 September 2024). As Soon as Possible but Rationally [Paper presentation]. CONCUR: International Conference on Concurrency Theory, Calgary, Canada.
Peer reviewed

Bruyère, V., Grandmont, C., & Raskin, J.-F. (29 August 2024). As Soon as Possible but Rationally. International Conference on Concurrency Theory (CONCUR), 311, 14:1--14:20. doi:10.4230/LIPIcs.CONCUR.2024.14
Peer reviewed

Grandmont, C. (26 April 2024). As Soon as Possible but Rationally [Paper presentation]. WG Data, Automata, Algebra, & Logic Days (Journées du GT DAAL), Rennes, France.
Peer reviewed

Grandmont, C. (15 March 2024). As Soon as Possible but Rationally [Paper presentation]. Centre Fédéré en Vérification (CFV), Brussels, Belgium.

Grandmont, C. (11 March 2024). Safety Combination and Parikh Automata applied to the Pareto Rational Synthesis [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium.

Grandmont, C. (23 October 2023). Rational Synthesis on Reachability Objectives through Tree Automata [Paper presentation]. Reading Group (Internal Seminar), Mons, Belgium.

Contact ORBi UMONS