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

Celý popis

Podrobná bibliografie

Vydáno v:	Logical methods in computer science Ročník 21, Issue 1; číslo 1
Hlavní autoři:	Monmege, Benjamin, Parreaux, Julie, Reynier, Pierre-Alain
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science Association 26.02.2025 Logical Methods in Computer Science e.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!