Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Infinite Runs in Weighted Timed Automata with Energy Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4320535 / 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: Deciding the winner in parity games is in \(\mathrm{UP}\cap\mathrm{co-UP}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Revision as of 17:48, 13 July 2024

scientific article
Language Label Description Also known as
English
Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games
scientific article

    Statements

    Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (English)
    0 references
    0 references
    0 references
    0 references
    2 May 2017
    0 references
    mean payoff games
    0 references
    value problem
    0 references
    optimal strategy synthesis
    0 references
    pseudo-polynomial time
    0 references
    energy games
    0 references
    small energy-progress measures
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references