This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Ou
展开▼
机译：本文提出了一系列表示性和复杂性结果，用于多玩家非零和并发游戏中纳什均衡的规范，计算和验证，其中玩家的目标表示为时间逻辑公式。 u
展开▼
