An average polynomial algorithm for solving antagonistic games on graphs (Q1647454): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cyclic games and linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the minimum cycle mean in a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction Mappings in the Theory Underlying Dynamic Programming / 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: Mean Cost Cyclical Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typical Properties of Winners and Losers [0.2ex] in Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of schedules with precedence logical conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / rank
 
Normal rank

Revision as of 00:23, 16 July 2024

scientific article
Language Label Description Also known as
English
An average polynomial algorithm for solving antagonistic games on graphs
scientific article

    Statements

    Identifiers