Jan Mačák

2 accepted papers

2026

Multiagent Stochastic Shortest Path Problem

Martin Jonáš, Antonín Kučera, Vojtěch Kůr, Jan Mačák, Vojtěch Řehák

IJCAI 2026

We introduce and study the multi-agent stochastic shortest path (MSSP) problem, in which k agents strive to reach a target state, aiming to minimize the expected time to reach the target by any agent. We analyze the computational and strategy-complexity of the problem in both autonomous and coordina

Cited by 0 Scholar ↗

2025

Steady-State Strategy Synthesis for Swarms of Autonomous Agents

Martin Jonáš, Antonín Kučera, Vojtěch Kůr, Jan Mačák

IJCAI 2025

The steady-state synthesis aims to construct a policy for a given MDP D such that the long-run average frequencies of visits to the vertices of D satisfy given numerical constraints. This problem is solvable in polynomial time, and memoryless policies are sufficient for approximating an arbitrary fr

Cited by 0 Source ↗PDF ↗Scholar ↗