Olivier Buffet

Olivier Buffet

Auto-generated profile, based on publicly available information

Olivier Buffet

LORIA, Université de Lorraine, CNRS, Inria, Nancy, France

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2009 in Artificial Intelligence
Verified
Journal Article
Closed access
OBOlivier Buffet
Olivier Buffet
DADouglas Aberdeen
Douglas Aberdeen

8 May 2020
Verified
Book Chapter
Closed access
PDF file
OBOlivier Buffet
Olivier Buffet
OPOlivier Pietquin
Olivier Pietquin
PWPaul Weng
Paul Weng

26 June 2020 in IEEE Transactions on Games
Verified
Journal Article
Closed access
OBOlivier Buffet
Olivier Buffet
JDJilles Steeve Dibangoye
Jilles Steeve Dibangoye
ASAbdallah Saffidine
Abdallah Saffidine
VTVincent Thomas
Vincent Thomas
In sequential decision-making, heuristic search algorithms allow exploiting both the initial situation and an admissible heuristic to efficiently search for an optimal solution, often for planning purposes. Such algorithms exist for problems with uncertain dynamics, partial observability, multiple criteria, or multiple collaborating agents. Here we look at two-player zero-sum stochastic games with discounted criterion, in a view to propose a solution tailored to the fully observable case, while solutions have been proposed for particular, though still more general, partially observable cases. This setting induces reasoning on both a lower and an upper bound of the value function, which leads us to proposing zsSG-HSVI, an algorithm based on Heuristic Search Value Iteration (HSVI), and which thus relies on generating trajectories. We demonstrate that, each player acting optimistically, and employing simple heuristic initializations, HSVI's convergence in finite time to an ϵ-optimal solution is preserved. An empirical study of the resulting approach is conducted on benchmark problems of various sizes.

30 December 2024
Verified
Book Chapter
Closed access
PDF file
YYYang You
Yang You
VTVincent Thomas
Vincent Thomas
FCFrancis Colas
Francis Colas
RSRobert Skilton
Robert Skilton
OBOlivier Buffet
Olivier Buffet

20 June 2013 in arXiv
Verified
Preprint
Open access
PDF file
CSCarlos Sarraute
Carlos Sarraute
OBOlivier Buffet
Olivier Buffet
JHJoerg Hoffmann
Joerg Hoffmann
Penetration Testing is a methodology for assessing network security, by generating and executing possible attacks. Doing so automatically allows for regular and systematic testing without a prohibitive amount of human labor. A key question then is how to generate the attacks. This is naturally formulated as a planning problem. Previous work (Lucangeli et al. 2010) used classical planning and hence ignores all the incomplete knowledge that characterizes hacking. More recent work (Sarraute et al. 2011) makes strong independence assumptions for the sake of scaling, and lacks a clear formal concept of what the attack planning problem actually is. Herein, we model that problem in terms of partially observable Markov decision processes (POMDP). This grounds penetration testing in a well-researched formalism, highlighting important aspects of this problem's nature. POMDPs allow to model information gathering as an integral part of the problem, thus providing for the first time a means to intelligently mix scanning actions with actual exploits.

26 October 2022 in arXiv
Verified
Preprint
Open access
PDF file
ADAurélien Delage
Aurélien Delage
OBOlivier Buffet
Olivier Buffet
JDJilles S. Dibangoye
Jilles S. Dibangoye
ASAbdallah Saffidine
Abdallah Saffidine
State-of-the-art methods for solving 2-player zero-sum imperfect information games rely on linear programming or regret minimization, though not on dynamic programming (DP) or heuristic search (HS), while the latter are often at the core of state-of-the-art solvers for other sequential decision-making problems. In partially observable or collaborative settings (e.g., POMDPs and Dec- POMDPs), DP and HS require introducing an appropriate statistic that induces a fully observable problem as well as bounding (convex) approximators of the optimal value function. This approach has succeeded in some subclasses of 2-player zero-sum partially observable stochastic games (zs- POSGs) as well, but how to apply it in the general case still remains an open question. We answer it by (i) rigorously defining an equivalent game to work with, (ii) proving mathematical properties of the optimal value function that allow deriving bounds that come with solution strategies, (iii) proposing for the first time an HSVI-like solver that provably converges to an $\epsilon$-optimal solution in finite time, and (iv) empirically analyzing it. This opens the door to a novel family of promising approaches complementing those relying on linear programming or iterative methods.