A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.029 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2114657710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of System Informatics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memoryless determinacy of parity and mean payoff games: a simple proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial structure and randomized subexponential algorithms for infinite games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4353562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On model checking for the \(\mu\)-calculus and its fragments / 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: On Nonterminating Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending Dijkstra’s Algorithm to Maximize the Shortest Path by Node-Wise Limited Arc Interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential randomized algorithm for the simple stochastic game problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of two person zero sum games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4117607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mean Cost Cyclical Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Polytope and Algorithm for Mean Payoff Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely unimodal numberings of a simple polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Revision as of 13:55, 25 June 2024

scientific article
Language Label Description Also known as
English
A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games
scientific article

    Statements

    A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (English)
    0 references
    0 references
    0 references
    19 February 2007
    0 references
    mean payoff game
    0 references
    cyclic game
    0 references
    parity game
    0 references
    ergodic partition
    0 references
    combinatorial linear programming
    0 references
    longest shortest path
    0 references
    iterative improvement
    0 references
    randomized subexponential algorithm
    0 references

    Identifiers

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