Profil

Main James

Université de Mons - UMONS > Faculté des Sciences > Service de Mathématiques effectives

Université de Mons - UMONS > Administration > Service de la Communication

Main Referenced Co-authors
RANDOUR, Mickaël  (6)
GOEMINNE, Aline  (2)
Sproston, Jeremy (2)
STAQUET, Gaëtan  (2)
VANDENHOVE, Pierre  (2)
Main Referenced Keywords
Complexity (1); complexity (1); Finite memory (1); finite-memory strategies (1); Finite-memory strategy (1);
Main Referenced Unit & Research Centers
CREMMI - Modélisation mathématique et informatique (25)
Main Referenced Disciplines
Mathematics (25)
Computer science (24)
Education & instruction (1)

Publications (total 26)

The most downloaded
56 downloads
Main, J., Randour, M., & Sproston, J. (2022). Timed Games with Bounded Window Parity Objectives. Lecture Notes in Computer Science, 13465, 165-182. doi:10.1007/978-3-031-15839-1_10 https://hdl.handle.net/20.500.12907/43066

The most cited

2 citations (Scopus®)

Main, J., & Randour, M. (2022). Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions. Leibniz International Proceedings in Informatics, 243, 22:1-22:18. doi:10.4230/LIPIcs.CONCUR.2022.22 https://hdl.handle.net/20.500.12907/43065

Equeter, L., Cools, A., Cultrera, L., Dupont, N., Fays, V., Giancola, K., Gillet, M., Glineur, C., Heyman, M., Invernizzi, S., Lucassen, L., Main, J., Mégret, A., Menet, Q., Mincheva, R., Pirson, F., Sobczak, F., Thiebault, F., Vachaudez, A., ... Vitry, V. (2024). Abstract book du Mardi des Chercheurs 2024. Abstract book du Mardi des Chercheurs.

Brihaye, T., Goeminne, A., Main, J., & Randour, M. (December 2023). Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). Leibniz International Proceedings in Informatics, 284, 1:1-1:26. doi:10.4230/LIPIcs.FSTTCS.2023.1
Peer Reviewed verified by ORBi

Main, J. (30 November 2023). Arena-independent Memory Bounds for Nash Equilibria in Reachability Games [Paper presentation]. Journées Annuelles du GT Vérif 2023, Paris, France.

Main, J. (09 October 2023). Arena-independent Memory Bounds for Nash Equilibria in Reachability Games [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Main, J. (01 October 2023). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Paper presentation]. LAMAS & SR 2023, Cracovie, Poland.
Peer reviewed

Main, J. (12 June 2023). Different Strokes in Randomised Strategies [Paper presentation]. Seminar at Masaryk University, Brno, Czechia.

Capon, C., Goeminne, A., Lecomte, N., Main, J., Randour, M., Staquet, G., Terefenko, A., & Vandenhove, P. (2023). À vous de jouer !

Main, J. (04 November 2022). Timed Games with Bounded Window Parity Objectives [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Main, J. (14 September 2022). Timed Games with Bounded Window Parity Objectives [Paper presentation]. International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS), Varsovie, Poland.

Main, J. (14 September 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Paper presentation]. International Conference on Concurrency Theory (CONCUR 2022), Varsovie, Poland.

Main, J. (11 July 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Paper presentation]. Journées Nationales du GT Vérif 2022, Bordeaux, France.
Editorial reviewed

Main, J. (30 June 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Paper presentation]. Highlights 2022 of Logic, Games and Automata, Paris, France.
Peer reviewed

Main, J. (31 May 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite- Memory Assumptions [Paper presentation]. Seminar on games, Turin, Italy.

Main, J. (19 May 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Main, J. (13 May 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Paper presentation]. PhD Day of the Belgian Mathematical Society, Liège, Belgium.

Main, J. (07 April 2022). Different Strokes in Randomised Strategies: Revisiting Kuhn’s Theorem with Finite-Memory Assumptions [Poster presentation]. Current Trends in Graph and Stochastic Games, Maastricht, Netherlands.

Main, J., Meurisse, Q., Randour, M., Staquet, G., Tamines, C., & Vandenhove, P. (2022). À vous de jouer !

Main, J. (10 March 2022). Les jeux à la rescousse de l’informatique [Paper presentation]. Le Mois du Doctorant, Mons, Belgium.

Main, J. (13 January 2022). Timed Automata, Weights and Abstractions [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Main, J., Randour, M., & Sproston, J. (2022). Timed Games with Bounded Window Parity Objectives. Lecture Notes in Computer Science, 13465, 165-182. doi:10.1007/978-3-031-15839-1_10
Peer reviewed

Main, J., & Randour, M. (2022). Different strokes in randomised strategies: Revisiting Kuhn's theorem under finite-memory assumptions. Leibniz International Proceedings in Informatics, 243, 22:1-22:18. doi:10.4230/LIPIcs.CONCUR.2022.22
Peer Reviewed verified by ORBi

Main, J. (18 November 2021). Timed Games with Window Parity Objectives [Paper presentation]. Journées du GT Vérif, Gif-sur-Yvette, France.

Main, J. (07 October 2021). Timed Games with Window Parity Objectives [Paper presentation]. UMONS Formal Methods Reading Group, Mons, Belgium.

Main, J. (16 September 2021). Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives [Paper presentation]. Highlights of Logic, Games and Automata, Online, Unknown/unspecified.
Peer reviewed

Main, J. (26 August 2021). Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives [Paper presentation]. International Conference on Concurrency Theory, Paris, France.

Main, J., Randour, M., & Sproston, J. (23 August 2021). Time Flies When Looking out of the Window: Timed Games with Window Parity Objectives. Leibniz International Proceedings in Informatics, 203, 25:1-25:16. doi:10.4230/LIPIcs.CONCUR.2021.25
Peer Reviewed verified by ORBi

Contact ORBi UMONS