A synthesis method for zero-sum mean-payoff asynchronous probabilistic games
Abstract The traditional synthesis problem aims to automatically construct a reactive system (if it exists) satisfying a given Linear Temporal Logic (LTL) specifications, and is often referred to as a qualitative problem. There is also a class of synthesis problems aiming at quantitative properties,...
Saved in:
Main Authors: | Wei Zhao, Wanwei Liu, Zhiming Liu, Tiexin Wang |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2025-01-01
|
Series: | Scientific Reports |
Online Access: | https://doi.org/10.1038/s41598-025-85589-9 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Games under Ambiguous Payoffs and Optimistic Attitudes
by: Wei Xiong
Published: (2014-01-01) -
Happiness and Status: the Zero-Sum Game?
by: I. V. Galochkin
Published: (2011-06-01) -
A Fast Approach to Bimatrix Games with Intuitionistic Fuzzy Payoffs
by: Min Fan, et al.
Published: (2014-01-01) -
The turnpike property for dynamic discrete time zero-sum games
by: Alexander J. Zaslavski
Published: (1999-01-01) -
Comparative analysis of extensive form zero sum game algorithms for Poker like games
by: Behbod Keshavarzi, et al.
Published: (2025-01-01)