Controlling a random population

11/04/2019
by   Thomas Colcombet, et al.
0

Bertrand et al. introduced a model of parameterised systems, where each agent is represented by a finite state system, and studied the following control problem: for any number of agents, does there exist a controller able to bring all agents to a target state? They showed that the problem is decidable and EXPTIME-complete in the adversarial setting, and posed as an open problem the stochastic setting, where the agent is represented by a Markov decision process. In this paper, we show that the stochastic control problem is decidable. Our solution makes significant uses of well quasi orders, of the max-flow min-cut theorem, and of the theory of regular cost functions.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/03/2021

Quantum Max-Flow Min-Cut theorem

The max-flow min-cut theorem is a cornerstone result in combinatorial op...
05/16/2022

EFX Allocations: Simplifications and Improvements

The existence of EFX allocations is a fundamental open problem in discre...
08/26/2020

Reputation-driven Decision-making in Networks of Stochastic Agents

This paper studies multi-agent systems that involve networks of self-int...
09/12/2021

Improved Algorithms for Misspecified Linear Markov Decision Processes

For the misspecified linear Markov decision process (MLMDP) model of Jin...
05/04/2021

Polynomial-Time Algorithms for Multi-Agent Minimal-Capacity Planning

We study the problem of minimizing the resource capacity of autonomous a...
05/07/2020

Checking Qualitative Liveness Properties of Replicated Systems with Stochastic Scheduling

We present a sound and complete method for the verification of qualitati...
04/01/2012

Learning from Humans as an I-POMDP

The interactive partially observable Markov decision process (I-POMDP) i...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.