Nothing Special   »   [go: up one dir, main page]
Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Computer Science and Game Theory

arXiv:2109.08317v1 (cs)
[Submitted on 17 Sep 2021]

Title:Stochastic Games with Disjunctions of Multiple Objectives

Authors:Tobias Winkler (RWTH Aachen University, Aachen, Germany), Maximilian Weininger (Technical University of Munich, Germany)
View PDF
Abstract:Stochastic games combine controllable and adversarial non-determinism with stochastic behavior and are a common tool in control, verification and synthesis of reactive systems facing uncertainty. Multi-objective stochastic games are natural in situations where several - possibly conflicting - performance criteria like time and energy consumption are relevant. Such conjunctive combinations are the most studied multi-objective setting in the literature. In this paper, we consider the dual disjunctive problem. More concretely, we study turn-based stochastic two-player games on graphs where the winning condition is to guarantee at least one reachability or safety objective from a given set of alternatives. We present a fine-grained overview of strategy and computational complexity of such disjunctive queries (DQs) and provide new lower and upper bounds for several variants of the problem, significantly extending previous works. We also propose a novel value iteration-style algorithm for approximating the set of Pareto optimal thresholds for a given DQ.
Comments: In Proceedings GandALF 2021, arXiv:2109.07798. arXiv admin note: substantial text overlap with arXiv:2108.04604
Subjects: Computer Science and Game Theory (cs.GT)
Cite as: arXiv:2109.08317 [cs.GT]
  (or arXiv:2109.08317v1 [cs.GT] for this version)
  https://doi.org/10.48550/arXiv.2109.08317
Journal reference: EPTCS 346, 2021, pp. 83-100
Related DOI: https://doi.org/10.4204/EPTCS.346.6

Submission history

From: EPTCS [view email] [via EPTCS proxy]
[v1] Fri, 17 Sep 2021 02:31:53 UTC (44 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
cs.GT
< prev   |   next >
new | recent | 2021-09
Change to browse by:
cs

References & Citations

export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)