On Satisficing in Quantitative Games release_crfdjsg625hhvfkqpw7jciidae

by Suguman Bansal, Krishnendu Chatterjee, Moshe Y. Vardi

Released as a article .

2021  

Abstract

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 for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound. This work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing overoptimization.
In text/plain format

Archived Files and Locations

application/pdf  666.7 kB
file_m4644xd5c5eezfxdzx4nzaqzyi
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2021-01-06
Version   v1
Language   en ?
arXiv  2101.02594v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 5705650d-9c63-40a1-84ad-c02303c87cf6
API URL: JSON