13 citations · 25 across the 15 of their papers we have counts for
17 papers
Mixture of Public and Private Distributions in Imperfect Information Games
Jérôme Arjonilla, Abdallah Saffidine, Tristan Cazenave
In imperfect information games (e.g. Bridge, Skat, Poker), one of the fundamental considerations is to infer the missing information while at the same time avoiding the disclosure…
Vision Transformers for Computer Go
Amani Sagri, Tristan Cazenave, Jérôme Arjonilla +1
Motivated by the success of transformers in various fields, such as language understanding and image analysis, this investigation explores their application in the context of the g…
Towards Tackling MaxSAT by Combining Nested Monte Carlo with Local Search
Hui Wang, Abdallah Saffidine, Tristan Cazenave
Recent work proposed the UCTMAXSAT algorithm to address Maximum Satisfiability Problems (MaxSAT) and shown improved performance over pure Stochastic Local Search algorithms (SLS).…
Implicit State and Goals in QBF Encodings for Positional Games (extended version)
Irfansha Shaik, Valentin Mayer-Eichberger, Jaco van de Pol +1
We address two bottlenecks for concise QBF encodings of maker-breaker positional games, like Hex and Tic-Tac-Toe. Our baseline is a QBF encoding with explicit variables for board p…
HSVI can solve zero-sum Partially Observable Stochastic Games
Aurélien Delage, Olivier Buffet, Jilles S. Dibangoye +1
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 heur…
On Bellman's Optimality Principle for zs-POSGs
Olivier Buffet, Jilles Dibangoye, Aurélien Delage +2
Many non-trivial sequential decision-making problems are efficiently solved by relying on Bellman's optimality principle, i.e., exploiting the fact that sub-problems are nested rec…