5 papers
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…
Point-to-set Principle and Constructive Dimension Faithfulness
Satyadev Nandakumar, Subin Pulari, Akhil S
Hausdorff -dimension is a notion of Hausdorff dimension developed using a restricted class of coverings of a set. We introduce an effective version of Hausdorff -dimension,…
Steady-State Strategy Synthesis for Swarms of Autonomous Agents
Martin Jonáš, AntonÃn KuÄera, VojtÄch Kůr +1
Steady-state synthesis aims to construct a policy for a given MDP such that the long-run average frequencies of visits to the vertices of satisfy given numerical constraint…
The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable
Miroslav Chodil, AntonÃn KuÄera
The Probabilistic Computational Tree Logic (PCTL) is the main specification formalism for discrete probabilistic systems modeled by Markov chains. Despite serious research attempts…
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…