collaborators

6 papers

cs.GT2026

An -Optimal Sequential Approach for Solving zs-POSGs

Erwan C. Escudie, Matthia Sabatelli, Jilles S. Dibangoye

While recent reductions of zero-sum partially observable stochastic games (zs-POSGs) to transition-independent stochastic games (TI-SGs) theoretically admit dynamic programming, pr…

cs.AI2026

ICE-ID: A Novel Historical Census Dataset for Longitudinal Identity Resolution

Gonçalo Hora de Carvalho, Lazar S. Popov, Sander Kaatee +6

We introduce \textbf{ICE-ID}, a benchmark dataset comprising 984,028 records from 16 Icelandic census waves spanning 220 years (1703--1920), with 226,864 expert-curated person iden…

cs.GT2025

On Dynamic Programming Theory for Leader-Follower Stochastic Games

Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur +1

Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best respond…

cs.GT2025

ε-Optimally Solving Two-Player Zero-Sum POSGs

Erwan Christian Escudie, Matthia Sabatelli, Olivier Buffet +1

We present a novel framework for ε-optimally solving two-player zero-sum partially observable stochastic games (zs-POSGs). These games pose a major challenge due to the absence of…

cs.LG2025

Optimally Solving Simultaneous-Move Dec-POMDPs: The Sequential Central Planning Approach

Johan Peralez, Aurèlien Delage, Jacopo Castellini +2

The centralized training for decentralized execution paradigm emerged as the state-of-the-art approach to -optimally solving decentralized partially observable Markov decision…

cs.GT2025

Solving Hierarchical Information-Sharing Dec-POMDPs: An Extensive-Form Game Approach

Johan Peralez, Aurélien Delage, Olivier Buffet +1

A recent theory shows that a multi-player decentralized partially observable Markov decision process can be transformed into an equivalent single-player game, enabling the applicat…