Proceedings

Multiagent Stochastic Shortest Path Problem

Download BibTeX Cite

Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence. Main Track. Pages 163-171.

https://doi.org/10.24963/ijcai.2026/19

Abstract

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 coordinated settings, and we design efficient strategy-synthesis algorithms. The algorithms are experimentally evaluated on instances of increasing size against natural baselines.

Martin Jonáš, Antonin Kucera, Vojtěch Kůr, Jan Mačák, and Vojtech Rehak. 2026. Multiagent Stochastic Shortest Path Problem. In Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-26. IJCAI, 163–171. https://doi.org/10.24963/ijcai.2026/19
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards