Quantitative fair simulation games
DOI10.1016/J.IC.2016.10.006zbMATH Open1370.68165OpenAlexW2547665360MaRDI QIDQ528184FDOQ528184
Authors: Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Yaron Velner 
Publication date: 12 May 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.10.006
Recommendations
simulationweighted automatamean-payoff gamesdiscounted-sum gamesfair simulationquantitative simulation
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)
Cites Work
- The complexity of stochastic games
- The complexity of mean payoff games on graphs
- Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
- An \(O(n^2)\) time algorithm for alternating Büchi games
- Borel determinacy
- Title not available (Why is that?)
- Simulation distances
- Positional strategies for mean payoff games
- Better Quality in Synthesis through Quantitative Objectives
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantitative languages
- Number of quantifiers is better than number of tape cells
- Fair simulation
- On the menbership problem for functional and multivalued dependencies in relational databases
- Pareto curves of multidimensional mean-payoff games
- The complexity of multi-mean-payoff and multi-energy games
- Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
- Temporal specifications with accumulative values
- Robust multidimensional mean-payoff games are undecidable
- Mean-payoff automaton expressions
- Half-Positional Determinacy of Infinite Games
- Improved algorithms for one-pair and \(k\)-pair Streett objectives
- Nested weighted automata
- Faster algorithms for alternating refinement relations
- Synthesis from LTL specifications with mean-payoff objectives
Cited In (10)
- Fair simulation for nondeterministic and probabilistic Büchi automata: a coalgebraic perspective
- Automata vs linear-programming discounted-sum inclusion
- Optimal repair for omega-regular properties
- Making weighted containment feasible: a heuristic based on simulation and abstraction
- On satisficing in quantitative games
- Buffered simulation games for Büchi automata
- Multi-buffer simulations for trace language inclusion
- Computing branching distances with quantitative games
- Generic forward and backward simulations. III: Quantitative simulations by matrices
- THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
This page was built for publication: Quantitative fair simulation games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q528184)
