License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2019.22
URN: urn:nbn:de:0030-drops-109246
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2019/10924/
Gutierrez, Julian ;
Najib, Muhammad ;
Perelli, Giuseppe ;
Wooldridge, Michael
Equilibrium Design for Concurrent Games
Abstract
In game theory, mechanism design is concerned with the design of incentives so that a desired outcome of the game can be achieved. In this paper, we study the design of incentives so that a desirable equilibrium is obtained, for instance, an equilibrium satisfying a given temporal logic property - a problem that we call equilibrium design. We base our study on a framework where system specifications are represented as temporal logic formulae, games as quantitative concurrent game structures, and players' goals as mean-payoff objectives. 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. We also study the complexity of various related decision and optimisation problems, such as optimality and uniqueness of solutions, and show that the complexities of all such problems lie within the polynomial hierarchy. As an application, equilibrium design can be used as an alternative solution to the rational synthesis and verification problems for concurrent games with mean-payoff objectives whenever no solution exists, or as a technique to repair, whenever possible, concurrent games with undesirable rational outcomes (Nash equilibria) in an optimal way.
BibTeX - Entry
@InProceedings{gutierrez_et_al:LIPIcs:2019:10924,
author = {Julian Gutierrez and Muhammad Najib and Giuseppe Perelli and Michael Wooldridge},
title = {{Equilibrium Design for Concurrent Games}},
booktitle = {30th International Conference on Concurrency Theory (CONCUR 2019)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-121-4},
ISSN = {1868-8969},
year = {2019},
volume = {140},
editor = {Wan Fokkink and Rob van Glabbeek},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10924},
URN = {urn:nbn:de:0030-drops-109246},
doi = {10.4230/LIPIcs.CONCUR.2019.22},
annote = {Keywords: Games, Temporal logic, Synthesis, Model checking, Nash equilibrium}
}
|
Keywords: |
|
Games, Temporal logic, Synthesis, Model checking, Nash equilibrium |
|
Collection: |
|
30th International Conference on Concurrency Theory (CONCUR 2019) |
|
Issue Date: |
|
2019 |
|
Date of publication: |
|
20.08.2019 |
