Introduces the multi-agent stochastic shortest path problem, analyzes its complexity in autonomous and coordinated modes, and provides efficient strategy-synthesis algorithms evaluated experimentally.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.MA 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multiagent Stochastic Shortest Path Problem
Introduces the multi-agent stochastic shortest path problem, analyzes its complexity in autonomous and coordinated modes, and provides efficient strategy-synthesis algorithms evaluated experimentally.