Conference icon

Conference

Decidability results for multi-objective stochastic games

Abstract:

We study stochastic two-player turn-based games in which the objective of one player is to ensure several infinite-horizon total reward objectives, while the other player attempts to spoil at least one of the objectives. The games have previously been shown not to be determined, and an approximation algorithm for computing a Pareto curve has been given. The major drawback of the existing algorithm is that it needs to compute Pareto curves for finite horizon objectives (for increasing length o...

Expand abstract
Publication status:
Published
Peer review status:
Peer reviewed
Version:
Accepted manuscript

Actions


Access Document


Files:
Publisher copy:
10.1007/978-3-319-46520-3_15

Authors


More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
More by this author
Institution:
University of Oxford
Department:
Oxford, MPLS, Computer Science
Role:
Author
Publisher:
Springer Publisher's website
Volume:
LNCS: 9938
Pages:
227-243
Publication date:
2016-01-01
DOI:
ISSN:
0302-9743
URN:
uuid:1fe7a9cd-4cb2-45b5-9356-4a6080eacbff
Source identifiers:
632187
Local pid:
pubs:632187
ISBN:
978-3-319-46519-7

Terms of use


Metrics


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