Multiagent Stochastic Shortest Path Problem
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917467797848064 |
|---|---|
| author | Jonáš, Martin Kučera, Antonín Kůr, Vojtěch Mačák, Jan Řehák, Vojtěch |
| author_facet | Jonáš, Martin Kučera, Antonín Kůr, Vojtěch Mačák, Jan Řehák, Vojtěch |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_06056 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Multiagent Stochastic Shortest Path Problem Jonáš, Martin Kučera, Antonín Kůr, Vojtěch Mačák, Jan Řehák, Vojtěch Multiagent Systems 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. |
| title | Multiagent Stochastic Shortest Path Problem |
| topic | Multiagent Systems |
| url | https://arxiv.org/abs/2605.06056 |