IJCAI19-Perelli2.pdf (278.58 kB)
Download file

On Computational Tractability for Rational Verification

Download (278.58 kB)
conference contribution
posted on 01.12.2020, 12:02 by Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge
Rational verification involves checking which temporal logic properties hold of a concurrent and multiagent system, under the assumption that agents in the system choose strategies in game theoretic equilibrium. Rational verification can be understood as a counterpart of model checking for multiagent systems, but while model checking can be done in polynomial time for some temporal logic specification languages such as CTL, and polynomial space with LTL specifications, rational verification is much more intractable: it is 2EXPTIME-complete with LTL specifications, even when using explicit-state system representations. In this paper we show that the complexity of rational verification can be greatly reduced by restricting specifications to GR(1), a fragment of LTL that can represent most response properties of reactive systems. We also provide improved complexity results for rational verification when considering players' goals given by mean-payoff utility functions -- arguably the most widely used quantitative objective for agents in concurrent and multiagent systems. In particular, we show that for a number of relevant settings, rational verification can be done in polynomial space or even in polynomial time.

Funding

Najib acknowledges the support of the Indonesia Endowment Fund for Education (LPDP), and Perelli the support of the ERC project “dSynMA” (grant agreement No 772459).

History

Citation

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence Main track. Pages 329-335. https://doi.org/10.24963/ijcai.2019/47

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Informatics

Source

28th International Joint Conference on Artificial Intelligence, August 10-16, 2019, Macao, China.

Version

AM (Accepted Manuscript)

Published in

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence

Pagination

329-335

Publisher

International Joint Conferences on Artificial Intelligence

isbn

978-0-9992411-4-1

Acceptance date

10/05/2019

Copyright date

2019

Spatial coverage

Macao

Temporal coverage: start date

10/08/2019

Temporal coverage: end date

16/08/2019

Language

en