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)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00453-016-0123-1 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W40 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A43 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6710366 / rank
 
Normal rank
Property / zbMATH Keywords
 
mean payoff games
Property / zbMATH Keywords: mean payoff games / rank
 
Normal rank
Property / zbMATH Keywords
 
value problem
Property / zbMATH Keywords: value problem / rank
 
Normal rank
Property / zbMATH Keywords
 
optimal strategy synthesis
Property / zbMATH Keywords: optimal strategy synthesis / rank
 
Normal rank
Property / zbMATH Keywords
 
pseudo-polynomial time
Property / zbMATH Keywords: pseudo-polynomial time / rank
 
Normal rank
Property / zbMATH Keywords
 
energy games
Property / zbMATH Keywords: energy games / rank
 
Normal rank
Property / zbMATH Keywords
 
small energy-progress measures
Property / zbMATH Keywords: small energy-progress measures / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1592208609 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1503.04426 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S00453-016-0123-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:22, 9 December 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