A short certificate of the number of universal optimal strategies for stopping simple stochastic games (Q1350746): 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/0020-0190(95)00181-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2061604345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Positive Integral Solutions of Linear Diophantine Equations / 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: The complexity of short two-person 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: A Combinatorial Problem Which Is Complete in Polynomial Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive Approximation Methods in Undiscounted Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered field property for stochastic games when the player who controls transitions changes from state to state / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a perfect strategy for nxn chess requires time exponential in n / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>N</i> by <i>N</i> Checkers is Exptime Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming and stationary strategies in stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monte-Carlo Algorithm for Estimating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonterminating Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete problems for deterministic polynomial time / 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: GO Is Polynomial-Space Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the graph isomorphism counting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Stochastic Games with Geometrical Interpretation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Prime Has a Succinct Certificate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for discounted stochastic games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Enumeration and Reliability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted Markov games; successive approximation and stopping times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discounted Markov games: Generalized policy iteration method / rank
 
Normal rank

Latest revision as of 10:06, 27 May 2024

scientific article
Language Label Description Also known as
English
A short certificate of the number of universal optimal strategies for stopping simple stochastic games
scientific article

    Statements

    A short certificate of the number of universal optimal strategies for stopping simple stochastic games (English)
    0 references
    0 references
    0 references
    27 February 1997
    0 references
    stochastic game
    0 references
    optimal strategy
    0 references
    counting algorithm
    0 references
    computational complexity
    0 references
    game theory
    0 references
    0 references
    0 references
    0 references

    Identifiers