My thesis

Generalisation and formalisation in game theory. The slides.

Journals

Singular Coverings and Non-Uniform Notions of Closed Set Computability, with Martin Ziegler, in Mathematical Logic Quarterly 2008.

Conferences and workshops with refereed publications

Acyclic preferences and existence of sequential Nash equilibria: a formal and constructive equivalence, at TPHOLs 2009. Proof supported by a formal proof in Coq.
Graphs and path equilibria, at AAIM 2008. The slides.
Singular Coverings and Non-Uniform Notions of Closed Set Computability, with Martin Ziegler at CCA 2007.
Non-Determinism and Nash Equilibria for Sequential Game over Partial Order, CLA '05. This article is supported by a formal proof in Coq.
Solving equations in a language with control operators, UNIF'04, with Pierre Lescanne (Superseded by my master's thesis in French).

Conferences and workshops with refereed local publications

Discrete Non Determinism and Nash Equilibria for Strategy-Based Games, at CIE 2008. The slides.
Acyclicity and Finite Linear Extendability: a Formal and Constructive Equivalence, at TPHOLs 2007. Proof supported by a formal proof in Coq included in the library CoLoR.

Conferences and workshops without publication

Graphs and path equilibria at GameComp and POPEYE 2008.
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence at CIE 2007. More detailed slides.

Research Reports

A Discrete Nash Theorem with Quadratic Complexity and Dynamic Equilibria by Stéphane Le Roux, Pierre Lescanne and René Vestergaard. Tech Report: JAIST/IS-RR-2006-006.