Publication details
Multiagent Stochastic Shortest Path Problem
| Authors | |
|---|---|
| Year of publication | 2026 |
| Type | Paper in proceedings |
| Conference | Proceedings of the Thirty-Fifth International Joint Conference on Artificial Intelligence |
| MU Faculty or unit | |
| Citation | |
| web | https://www.ijcai.org/proceedings/2026/19 |
| Doi | https://doi.org/10.24963/ijcai.2026/19 |
| Keywords | Agent-based and Multi-agent Systems: Coordination and cooperation; Agent-based and Multi-agent Systems: Multi-agent planning |
| Attached files | |
| Description | 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. |
| Related projects: |