Conference item icon

Conference item

Nash equilibrium and bisimulation invariance

Abstract:
Game theory provides a well-established framework for the analysis of concurrent and multi-agent systems. The basic idea is that concurrent processes (agents) can be understood as corresponding to players in a game; plays represent the possible computation runs of the system; and strategies define the behaviour of agents. Typically, strategies are modelled as functions from sequences of system states to player actions. Analysing a system in such a way involves computing the set of (Nash) equilibria in the game. However, we show that, with respect to the above model of strategies---the standard model in the literature---bisimilarity does not preserve the existence of Nash equilibria. Thus, two concurrent games which are behaviourally equivalent from a semantic perspective, and which from a logical perspective satisfy the same temporal formulae, nevertheless have fundamentally different properties from a game theoretic perspective. In this paper we explore the issues raised by this discovery, and investigate three models of strategies with respect to which the existence of Nash equilibria is preserved under bisimilarity. We also use some of these models of strategies to provide new semantic foundations for logics for strategic reasoning, and investigate restricted scenarios where bisimilarity can be shown to preserve the existence of Nash equilibria with respect to the conventional model of strategies in the literature.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.4230/LIPIcs.CONCUR.2017.17

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author
ORCID:
0000-0002-9329-8410

Contributors

Role:
Editor
Role:
Editor


More from this funder
Funder identifier:
https://ror.org/0472cxd90
Grant:
291528


Publisher:
Schloss Dagstuhl
Host title:
28th International Conference on Concurrency Theory (CONCUR 2017)
Pages:
17:1--17:16
Series:
Leibniz International Proceedings in Informatics (LIPIcs)
Series number:
85
Publication date:
2017-09-01
Acceptance date:
2017-06-16
Event title:
28th International Conference on Concurrency Theory (CONCUR 2017)
Event location:
Berlin, Germany
Event start date:
2017-09-05
Event end date:
2017-09-08
DOI:
ISSN:
1868-8969
ISBN:
9783959770484


Language:
English
Keywords:
Pubs id:
pubs:701323
UUID:
uuid:0e299546-9538-404e-9c56-fa4760cf8915
Local pid:
pubs:701323
Source identifiers:
701323
Deposit date:
2017-06-19

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP