Conference item icon

Conference item

Expressiveness and complexity results for strategic reasoning

Abstract:

This paper presents a range of expressiveness and complexity results for the specification, computation, and verification of Nash equilibria in multi-player non-zero-sum concurrent games in which players have goals expressed as temporal logic formulae. Our results are based on a novel approach to the characterisation of equilibria in such games: a semantic characterisation based on winning strategies and memoryful reasoning. This characterisation allows us to obtain a number of other resul...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


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
Name:
European Research Council
Grant:
291528 (“RACE”
Publisher:
Schloss Dagstuhl
Host title:
26th International Conference on Concurrency Theory (CONCUR 2015)
Volume:
42
Pages:
268-282
Publication date:
2015-08-26
Acceptance date:
2015-06-15
Event title:
Concur 2015, 26th Conference on Concurrency Theory
Event location:
Madrid, Spain
Event website:
http://mafalda.fdi.ucm.es/concur2015/
Event start date:
2015-09-01
Event end date:
2015-09-04
DOI:
ISSN:
1868-8969
ISBN:
9783939897910
Language:
English
Keywords:
Pubs id:
pubs:572461
UUID:
uuid:0a035723-1276-4865-9301-d5822e379dee
Local pid:
pubs:572461
Source identifiers:
572461
Deposit date:
2015-11-12

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