Cargando…

On Satisficing in Quantitative Games

Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching f...

Descripción completa

Detalles Bibliográficos
Autores principales: Bansal, Suguman, Chatterjee, Krishnendu, Vardi, Moshe Y.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7979197/
http://dx.doi.org/10.1007/978-3-030-72016-2_2