Fair quantitative games

DOI10.1007/978-3-031-90897-2_16MaRDI QIDQ6889880zbMATH OpenFDO

Authors Ritam Raha, Irmak Sağlam, Anne-Kathrin Schmuck

Publication date 4 December 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-031-90897-2_16

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3972158 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• A faster deterministic exponential time algorithm for energy games and mean payoff games
• A pseudo-quasi-polynomial algorithm for mean-payoff parity games
• Augmented finite transition systems as abstractions for control synthesis
• Automata, Languages and Programming
• Averaging in LTL
• Better Quality in Synthesis through Quantitative Objectives
• Borel determinacy
• Code aware resource management
• Computer Science Logic
• Control of -automata under state fairness assumptions
• Energy and Mean-Payoff Parity Markov Decision Processes
• Fair -regular games
• Fair quantitative games
• Fairness and related properties in transition systems - a temporal logic to deal with fairness
• Fast symbolic algorithms for omega-regular games under strong transition fairness
• Faster algorithms for mean-payoff games
• Formal methods to comply with rules of the road in autonomous driving: state of the art and grand challenges
• Formalizing and Reasoning about Quality
• Fully observable non-deterministic planning as assumption-based reactive synthesis
• Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
• Mathematical Foundations of Computer Science 2004
• Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games
• Minimizing expected cost under hard Boolean constraints, with applications to quantitative synthesis
• Model checking discounted temporal properties
• Multidimensional beyond worst-case and almost-sure problems for mean-payoff objectives
• Positional strategies for mean payoff games
• Reachability games with relaxed energy constraints
• Solving odd-fair parity games
• The complexity of mean payoff games on graphs
• The complexity of multi-mean-payoff and multi-energy games
• The sensing cost of monitoring and synthesis
• Tighter Lower Bounds on the Exact Complexity of String Matching
• Weak, strong, and strong cyclic planning via symbolic model checking

Cited in

(1)

• Fair quantitative games

This page was built for publication: Fair quantitative games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6889880)