Journal article icon

Journal article

Reasoning about equilibria in game-like concurrent systems

Abstract:
In this paper we study techniques for reasoning about game-like concurrent systems, where the components of the system act rationally and strategically in pursuit of logically-specified goals. Specifically, we start by presenting a computational model for such concurrent systems, and investigate its computational, mathematical, and game-theoretic properties. We then define and investigate a branching-time temporal logic for reasoning about the equilibrium properties of game-like concurrent systems. The key operator in this temporal logic is a novel path quantifier [NE]ϕ, which asserts that ϕ holds on all Nash equilibrium computations of the system.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1016/j.apal.2016.10.009

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 from this funder
Grant:
Advanced Investigator Grant 291528 (“RACE”


Publisher:
Elsevier
Journal:
Annals of Pure and Applied Logic More from this journal
Volume:
168
Issue:
2
Pages:
373-403
Publication date:
2016-10-13
Acceptance date:
2016-04-17
DOI:
EISSN:
0168-0072
ISSN:
1873-2461


Keywords:
Pubs id:
pubs:616307
UUID:
uuid:f282a4be-34fb-4253-9cf0-771fdb71cf6b
Local pid:
pubs:616307
Source identifiers:
616307
Deposit date:
2016-04-18

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