Multi-player games with LDL goals over finite traces

被引:1
|
作者
Gutierrez, Julian [1 ]
Perelli, Giuseppe [2 ]
Wooldridge, Michael [3 ]
机构
[1] Monash Univ, Fac Informat Technol, Clayton, Vic, Australia
[2] Sapienza Univ Rome, Dept Comp Control & Management Engn, Rome, Italy
[3] Univ Oxford, Dept Comp Sci, Oxford, England
基金
欧洲研究理事会;
关键词
Games; Temporal logic; Multi-agent systems; Formal verification;
D O I
10.1016/j.ic.2020.104555
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Linear Dynamic Logic on finite traces (LDLF) is a powerful logic for reasoning about the behaviour of concurrent and multi-agent systems. In this paper, we investigate techniques for both the characterisation and verification of equilibria in multi-player games with goals/objectives expressed using logics based on LDLF. This study builds upon a generalisation of Boolean games, a logic-based game model of multi-agent systems where players have goals succinctly represented in a logical way. Because LDLF goals are considered, in the settings we study-Reactive Modules games and iterated Boolean games with goals over finite traces-players' goals can be defined to be regular properties while achieved in a finite, but arbitrarily large, trace. In particular, using alternating automata, the paper investigates automata-theoretic approaches to the characterisation and verification of (pure strategy Nash) equilibria, shows that the set of Nash equilibria in multi-player games with LDLF objectives is regular, and provides complexity results for the associated automata constructions. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页数:16
相关论文
共 50 条
  • [21] Multi-player Multi-armed Bandits: Decentralized Learning with IID Rewards
    Kalathil, Dileep
    Nayyar, Naumaan
    Jain, Rahul
    2012 50TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2012, : 853 - 860
  • [22] Selfish cops and active robber: Multi-player pursuit evasion on graphs
    Konstantinidis, G.
    Kehagias, A.
    THEORETICAL COMPUTER SCIENCE, 2019, 780 : 84 - 102
  • [23] Decentralized Learning for Channel Allocation in IoT Networks Over Unlicensed Bandwidth as a Contextual Multi-Player Multi-Armed Bandit Game
    Wang, Wenbo
    Leshem, Amir
    Niyato, Dusit
    Han, Zhu
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2022, 21 (05) : 3162 - 3178
  • [24] Multi-Player Multi-Armed Bandits With Collision-Dependent Reward Distributions
    Shi, Chengshuai
    Shen, Cong
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2021, 69 : 4385 - 4402
  • [25] A Software Framework for Multi Player Robot Games
    Hansen, Soren Tranberg
    Ontanon, Santiago
    SOCIAL ROBOTICS, ICSR 2010, 2010, 6414 : 131 - 140
  • [26] Optimal Evading Strategies and Task Allocation in Multi-player Pursuit–Evasion Problems
    Venkata Ramana Makkapati
    Panagiotis Tsiotras
    Dynamic Games and Applications, 2019, 9 : 1168 - 1187
  • [27] A Game Theoretic Method for Two-Team Multi-Player Autonomous Racing
    Hu, Zhenghao
    Li, Xiuxian
    Meng, Min
    Zhao, Shiyu
    IEEE ROBOTICS AND AUTOMATION LETTERS, 2024, 9 (09): : 7581 - 7588
  • [28] Off-policy Q-learning: Solving Nash equilibrium of multi-player games with network-induced delay and unmeasured state
    Li, Jinna
    Xiao, Zhenfei
    Fan, Jialu
    Chai, Tianyou
    Lewis, Frank L. L.
    AUTOMATICA, 2022, 136
  • [29] Online event-based adaptive critic design with experience replay to solve partially unknown multi-player nonzero-sum games
    Liu, Pengda
    Zhang, Huaguang
    Su, Hanguang
    Ren, He
    NEUROCOMPUTING, 2021, 458 : 219 - 231
  • [30] Optimal Evading Strategies and Task Allocation in Multi-player Pursuit-Evasion Problems
    Makkapati, Venkata Ramana
    Tsiotras, Panagiotis
    DYNAMIC GAMES AND APPLICATIONS, 2019, 9 (04) : 1168 - 1187