On Satisficing in Quantitative Games
Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. {\em Optimization} is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the {\em 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.
Code (1)
Similar Papers 제목 키워드 기반
Satisficing Equilibrium
We propose a solution concept in which each agent $i$ does not necessarily optimize but selects one of their top $k_i$ actions. Our concept accounts for heterogeneous agents' bounded rationality. We show that there exist…
AllSatisficing Paths and Independent Multi-Agent Reinforcement Learning in Stochastic Games
In multi-agent reinforcement learning (MARL), independent learners are those that do not observe the actions of other agents in the system. Due to the decentralization of information, it is challenging to design independ…
Multi-agent Reinforcement Learningreinforcement-learningReinforcement Learning (RL)Grouped Satisficing Paths in Pure Strategy Games: a Topological Perspective
In game theory and multi-agent reinforcement learning (MARL), each agent selects a strategy, interacts with the environment and other agents, and subsequently updates its strategy based on the received payoff. This proce…
Multi-agent Reinforcement LearningPaths to Equilibrium in Games
In multi-agent reinforcement learning (MARL) and game theory, agents repeatedly interact and revise their strategies as new data arrives, producing a sequence of strategy profiles. This paper studies sequences of strateg…
Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningContextual Exploration Using a Linear Approximation Method Based on Satisficing
Deep reinforcement learning has enabled human-level or even super-human performance in various types of games. However, the amount of exploration required for learning is often quite large. Deep reinforcement learning al…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)