A Numerical Approach to the Realizability Problems for Memoryless Nash and Epsilon Equilibria in Concurrent Multiplayer Reachability Games

2026-09-03

AI Summary

本文通过数值限制方法研究了并发多人可达性游戏中无记忆纳什均衡和ε-均衡的实现问题，分析了不同数域下该问题的复杂度。

Abstract

The existence of equilibria, which is called the realizability problem in the formal methods community, for probabilistic undiscounted state-based systems has proven to be an incredibly challenging research setting. In this paper, we consider a restricted version of the classic realizability problem by focusing on equilibria that are both memoryless and numerically constrained. While the restriction to memoryless strategies is relatively common in the literature, numerical constraints, to the best of our knowledge, represent a new and powerful approach. First, we consider the existence of memoryless equilibria when all numbers involved must be rational numbers of a pre-defined limited size. Then, we extend this analysis to field extensions of the rational numbers created through radical algebraic generators. When the basis is provided for the latter, both realizability problems are NP-complete for both exact and epsilon Nash equilibria. Finally, we consider an unconstrained numerical setting. While the characterization of the exact Nash equilibria realizability problem as ETR-complete is one of the most celebrated results in the literature, we demonstrate that the constructions underlying this result are flawed as presented. We then mend said constructions to preserve the ETR upper bound, and note that the lower bound in the literature does not apply to the epsilon-equilibrium setting. Overall, this paper demonstrates an interesting relationship between the complexity of the realizability problem and the "complexity" of the numbers involved in the representations of strategies.

Problem

• Nash Equilibria
• Realizability Problem
• Memoryless Strategies
• Numerical Constraints
• Concurrent Multiplayer Reachability Games

Innovation

• numerical constraints
• memoryless equilibria
• rational numbers of limited size
• field extensions
• ETR-completeness