Minimizing Regret in Discounted-Sum Games

From MaRDI portal

Revision as of 20:48, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5278417

Jump to:navigation, search

DOI10.4230/LIPIcs.CSL.2016.30zbMath1369.91036arXiv1511.00523OpenAlexW2963656969MaRDI QIDQ5278417

Paul Hunter, Guillermo A. Pérez, Jean-François Raskin

Publication date: 19 July 2017

Full work available at URL: https://arxiv.org/abs/1511.00523

zbMATH Keywords

verification synthesis game theory regret quantitative games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Token Games and History-Deterministic Quantitative-Automata

This page was built for publication: Minimizing Regret in Discounted-Sum Games

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5278417&oldid=19924553"