You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Multi-Actor Markov Decision Processes
Hyun-Soo Ahn and Rhonda Righter
Journal of Applied Probability
Vol. 42, No. 1 (Mar., 2005), pp. 15-26
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/30040766
Page Count: 12
You can always find the topics here!Topics: Optimal policy, Network servers, Markov processes, Random variables, Scheduling, Queueing networks, Greedy algorithms, Mathematical problems
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We give a very general reformulation of multi-actor Markov decision processes and show that there is a tendency for the actors to take the same action whenever possible. This considerably reduces the complexity of the problem, either facilitating numerical computation of the optimal policy or providing a basis for a heuristic.
Journal of Applied Probability © 2005 Applied Probability Trust