3 papers
cs.MA2026
Multiagent Stochastic Shortest Path Problem
Martin Jonáš, AntonÃn KuÄera, VojtÄch Kůr +2
We introduce and study the multi-agent stochastic shortest path (MSSP) problem, in which agents strive to reach a target state, aiming to minimize the expected time to reach th…
cs.AI2026
Memory Assignment for Finite-Memory Strategies in Adversarial Patrolling Games
VojtÄch Kůr, VÃt Musil, VojtÄch Åehák
Adversarial Patrolling games form a subclass of Security games where a Defender moves between locations, guarding vulnerable targets. The main algorithmic problem is constructing a…
cs.AI2024
Multiple Mean-Payoff Optimization under Local Stability Constraints
David KlaÅ¡ka, AntonÃn KuÄera, VojtÄch Kůr +2
The long-run average payoff per transition (mean payoff) is the main tool for specifying the performance and dependability properties of discrete systems. The problem of constructi…