A note on the approximation of mean-payoff games (Q2446598): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.02.010 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2014.02.010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065358412 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positional strategies for mean payoff games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclical games with prohibitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cost of Traveling between Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Quality in Synthesis through Quantitative Objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Mean Payoff Games: Smoothed Analysis and Approximation Schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: On canonical forms for zero-sum stochastic mean payoff games / 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: Automated analysis of real-time scheduling using graph games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time algorithms for energy games with special weight structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4287357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantitative Languages Defined by Functional Automata / 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: Simple stochastic games, parity games, mean payoff games and discounted payoff games are all LP-type problems / 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: Results on the propositional \(\mu\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for mean-payoff games / 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: Mean Cost Cyclical Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal search for rationals / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Parity and Payoff Games to Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of mean payoff games on graphs / 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 / DOI
 
Property / DOI: 10.1016/J.IPL.2014.02.010 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:39, 18 December 2024

scientific article
Language Label Description Also known as
English
A note on the approximation of mean-payoff games
scientific article

    Statements

    A note on the approximation of mean-payoff games (English)
    0 references
    17 April 2014
    0 references
    mean-payoff games
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers