Playing Stochastically in Weighted Timed Games to Emulate Memory

05/03/2021
by   Benjamin Monmege, et al.
0

Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while minimising the cumulated weight. While knowing if Min has a strategy to guarantee a value lower than a given threshold is known to be undecidable (with two or more clocks), several conditions, one of them being the divergence, have been given to recover decidability. In such weighted timed games (like in untimed weighted games in the presence of negative weights), Min may need finite memory to play (close to) optimally. This is thus tempting to try to emulate this finite memory with other strategic capabilities. In this work, we allow the players to use stochastic decisions, both in the choice of transitions and of timing delays. We give for the first time a definition of the expected value in weighted timed games, overcoming several theoretical challenges. We then show that, in divergent weighted timed games, the stochastic value is indeed equal to the classical (deterministic) value, thus proving that Min can guarantee the same value while only using stochastic choices, and no memory.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 3

page 5

page 7

page 9

page 11

page 13

page 21

05/11/2020

Reaching Your Goal Optimally by Playing at Random

Shortest-path games are two-player zero-sum games played on a graph equi...
09/07/2020

One-Clock Priced Timed Games with Arbitrary Weights

Priced timed games are two-player zero-sum games played on priced timed ...
12/03/2018

Symbolic Approximation of Weighted Timed Games

Weighted timed games are zero-sum games played by two players on a timed...
04/26/2021

Optimal controller synthesis for timed systems

Weighted timed games are zero-sum games played by two players on a timed...
08/26/2020

Optimal Strategies in Weighted Limit Games (full version)

We prove the existence and computability of optimal strategies in weight...
09/23/2020

Optimal Strategies in Weighted Limit Games

We prove the existence and computability of optimal strategies in weight...
03/09/2021

Synthesis from Weighted Specifications with Partial Domains over Finite Words

In this paper, we investigate the synthesis problem of terminating react...
This week in AI

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