A Brouwer fixed-point mapping approach to communicating Markov decision processes (Q1115361): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal decision procedures for finite Markov chains. Part II: Communicating systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multichain Markov Renewal Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction mappings underlying undiscounted Markov decision problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fixed Point Approach to Undiscounted Markov Renewal Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5335719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov-Renewal Programming. I: Formulation, Finite Return Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solvability of Bellman's functional equation for a Markovian decision process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation Theory and Undiscounted Markov Renewal Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solvability of Bellman's functional equations for Markov renewal programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On undiscounted markovian decision processes with compact action spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of relative values for undiscounted Markovian decision processes with a scalar gain rate / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Asymptotic Behavior of Undiscounted Value Iteration in Markov Decision Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Functional Equations of Undiscounted Markov Renewal Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric convergence of value-iteration in multichain Markov decision problems / rank
 
Normal rank

Revision as of 12:56, 19 June 2024

scientific article
Language Label Description Also known as
English
A Brouwer fixed-point mapping approach to communicating Markov decision processes
scientific article

    Statements

    A Brouwer fixed-point mapping approach to communicating Markov decision processes (English)
    0 references
    1987
    0 references
    The solvability of the functional equations of communicating Markov decision processes is demonstrated by an elementary application of the Brouwer fixed-point mapping theorem. The technical assumptions include finite state space and finite or compact action spaces.
    0 references
    undiscounted stationary infinite horizon
    0 references
    semi-Markovian decision processes
    0 references
    solvability
    0 references
    functional equations
    0 references
    communicating Markov decision processes
    0 references
    Brouwer fixed-point mapping theorem
    0 references
    finite state space
    0 references
    finite or compact action spaces
    0 references
    0 references

    Identifiers