Bounded Approximate Payoff Division for MC-nets Games
نویسندگان
چکیده
منابع مشابه
IDD-MC - a model checker for bounded stochastic Petri nets
IDD-MC is a symbolic analysis tool for bounded stochastic Petri nets with extended arcs. Its engine is based on Interval Decision Diagrams and facilitate the validation of standard Petri net properties, model checking the Computation Tree Logic (CTL) and the Stochastic Continuous Logic (CSL). In this paper we give an informal overview of the currently implemented analysis techniques and report ...
متن کاملA robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
The celebrated von Neumann minimax theorem is a fundamental theorem in two-person zero-sum games. In this paper, we present a generalization of the von Neumann minimax theorem, called robust von Neumann minimax theorem, in the face of data uncertainty in the payoff matrix via robust optimization approach. We establish that the robust von Neumann minimax theorem is guaranteed for various classes...
متن کاملBounded Approximate Character Amenability of Banach Algebras
The bounded approximate version of $varphi$-amenability and character amenability are introduced and studied. These new notions are characterized in several different ways, and some hereditary properties of them are established. The general theory for these concepts is also developed. Moreover, some examples are given to show that these notions are different from the others. Finally, bounded ap...
متن کاملFaster algorithms for mean-payoff games
In this paper, we study algorithmic problems for quantitative models that are motivated by the applications in modeling embedded systems. We consider two-player games played on a weighted graph with mean-payoff objective and with energy constraints. We present a new pseudopolynomial algorithm for solving such games, improving the best known worst-case complexity for pseudopolynomial mean-payoff...
متن کاملAn Improved Algorithm for Discounted Payoff Games
We show that an optimal counterstrategy against a fixed positional strategy in a generalized discounted payoff game, where edges have individual discounts, can be computed in O(mn logm) strongly polynomial time, where n and m are the number of vertices and edges in the game graph. This results in the best known strongly subexponential time bound for solving two-player generalized discounted pay...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2022
ISSN: ['0916-8532', '1745-1361']
DOI: https://doi.org/10.1587/transinf.2022edp7039