A Brouwer fixed-point mapping approach to communicating Markov decision processes (Q1115361): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0022-247x(87)90297-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060219734 / rank | |||
Normal rank | |||
Latest revision as of 11:12, 30 July 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
