Papers › Augmented Probability Simulation Methods for Sequential Games

Augmented Probability Simulation Methods for Sequential Games

10 Oct 2019arXiv:1910.04574links table onlyarchive 2025-07-28

Tahir Ekin, Roi Naveiro, Alberto Torres-Barrán, David Ríos-Insua

The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.

We present a robust framework with computational algorithms to support decision makers in sequential games. Our framework includes methods to solve games with complete information, assess the robustness of such solutions and, finally, approximate adversarial risk analysis solutions when lacking complete information. Existing simulation based approaches can be inefficient when dealing with large sets of feasible decisions; the game of interest may not even be solvable to the desired precision for continuous decisions. Hence, we provide a novel alternative solution method based on the use of augmented probability simulation. While the proposed framework conceptually applies to multi-stage sequential games, the discussion focuses on two-stage sequential defend-attack problems.

PaperPDFCode

Code

albertotb/aps officialmentioned in paper report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections