On satisficing in quantitative games
From MaRDI portal
Publication:2044188
DOI10.1007/978-3-030-72016-2_2zbMath1467.68161arXiv2101.02594OpenAlexW3150261213MaRDI QIDQ2044188
Krishnendu Chatterjee, Moshe Y. Vardi, Suguman Bansal
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/2101.02594
Programming involving graphs or networks (90C35) Games involving graphs (91A43) Applications of game theory (91A80) Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantitative fair simulation games
- Recognizing safety and liveness
- The complexity of mean payoff games on graphs
- Comparator automata in quantitative verification
- Automata, logics, and infinite games. A guide to current research
- Universal graphs and good for games automata: new tools for infinite duration games
- Better Quality in Synthesis through Quantitative Objectives
- Permissive strategies: from parity games to safety games
- Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor
- Exact and Approximate Determinization of Discounted-Sum Automata
- Stochastic Games
- Model checking quantitative hyperproperties
- Formal specification for deep neural networks
This page was built for publication: On satisficing in quantitative games
