no code implementations • 6 Jul 2022 • Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge
To this end, we consider both utilitarian and egalitarian social welfare and show that computing such outcomes is either PSPACE-complete or NP-complete.
no code implementations • 19 Jul 2021 • Julian Gutierrez, Lewis Hammond, Anthony W. Lin, Muhammad Najib, Michael Wooldridge
Rational verification is the problem of determining which temporal logic properties will hold in a multi-agent system, under the assumption that agents in the system act rationally, by choosing strategies that collectively form a game-theoretic equilibrium.
no code implementations • 18 Jun 2021 • Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge
In particular, we consider system specifications given by LTL and GR(1) formulae, and show that implementing a mechanism to ensure that a given temporal logic property is satisfied on some/every Nash equilibrium of the game, whenever such a mechanism exists, can be done in PSPACE for LTL properties and in NP/$\Sigma^{P}_{2}$ for GR(1) specifications.
1 code implementation • 28 Sep 2020 • Oliver Markgraf, Chih-Duo Hong, Anthony W. Lin, Muhammad Najib, Daniel Neider
Parameterized synthesis offers a solution to the problem of constructing correct and verified controllers for parameterized systems.
Logic in Computer Science Formal Languages and Automata Theory
1 code implementation • 13 Aug 2020 • Julian Gutierrez, Muhammad Najib, Giuseppe Perelli, Michael Wooldridge
In the context of multi-agent systems, the rational verification problem is concerned with checking which temporal logic properties will hold in a system when its constituent agents are assumed to behave rationally and strategically in pursuit of individual objectives.
