Playing Stochastically in Weighted Timed Games to Emulate Memory

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...

Full description

Saved in:

Bibliographic Details
Published in:	Logical methods in computer science Vol. 21, Issue 1; no. 1
Main Authors:	Monmege, Benjamin, Parreaux, Julie, Reynier, Pierre-Alain
Format:	Journal Article
Language:	English
Published:	Logical Methods in Computer Science Association 26.02.2025 Logical Methods in Computer Science e.V
Subjects:	Computation and Language Computer Science computer science - computer science and game theory Computer Science and Game Theory Formal Languages and Automata Theory Logic in Computer Science
ISSN:	1860-5974, 1860-5974
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!