Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (Q5089201): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.MFCS.2020.34 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Combinatorial Simplex Algorithms Can Solve Mean Payoff Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding parity games in quasipolynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal graphs and good for games automata: new tools for infinite duration games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A pseudo-quasi-polynomial algorithm for mean-payoff parity games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5091276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Distance Labeling Schemes for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic games and an algorithm to find minimax cycle means in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5144638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming, the simplex algorithm and simple polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicat Representation of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modal μ perspective on solving parity games in quasi-polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5874219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical problems for the next century / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite games on finitely coloured graphs with applications to automata on infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://hal-cnrs.archives-ouvertes.fr/hal-03800510 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3043364318 / rank
 
Normal rank
Property / title
 
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (English)
Property / title: Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.MFCS.2020.34 / rank
 
Normal rank

Latest revision as of 15:53, 30 December 2024

scientific article; zbMATH DE number 7559405
Language Label Description Also known as
English
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games
scientific article; zbMATH DE number 7559405

    Statements

    0 references
    0 references
    0 references
    18 July 2022
    0 references
    mean payoff games
    0 references
    universal graphs
    0 references
    value iteration
    0 references
    0 references
    0 references
    0 references
    0 references
    Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games (English)
    0 references

    Identifiers