The complexity of Markov decision processes

The complexity of Markov decision processes

Research supported by the National Science Foundation and IBM.

Bibliographic Details
Other Authors:	Papadimitriou, Christos H.
Language:	eng
Published:	Laboratory for Information and Decision Systems?, MIT?] 2003
Subjects:	TK7855.M41 E3845 no.1479
Online Access:	http://hdl.handle.net/1721.1/2893

Similar Items

Polynomial time algorithms for finite horizon, stationary Markov decision processes
Published: (2003)

Simulation-based optimization of Markov reward processes
Published: (2003)

Structural decomposition of multiple time scale Markov processes
Published: (2003)

Optimal control of noisy finite-state Markov processes
Published: (2002)

Multiscale representations of Markov random fields
Published: (2003)

Multiscale representations of Markov random fields
Published: (2003)

Upper bounds for symmetric Markov transition functions
Published: (2003)

Modeling electrocardiograms using interacting Markov chains
Published: (2003)

Optimal sequential vector quantization of Markov sources
Published: (2003)

Markov random fields, stochastic quantization and image analysis
Published: (2003)

Statistical multiplexing of multiple time-scale Markov streams
Published: (2003)

Markov random fields, stochastic quantization and image analysis
Published: (2002)

Optimal stopping of Markov processes : Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives
Published: (2003)

Control of Markov chains with long-run average cost criterion
Published: (2003)

The reduction of perturbed Markov generators : an algorithm exposing the role of transient states
Published: (2003)

Event-based estimation of interacting Markov chains with applications to electrocardiogram analysis
Published: (2003)

Weak convergence of Markov chain sampling methods and annealing algorithms to diffusions
Published: (2003)

Bayesian signal reconstruction, Markov random fields, and x-ray crystallography
Published: (2003)

Geometric bounds for stationary distributions of infinite Markov chains via Lyapunov functions
Published: (2003)

Hierarchical aggregation of singularly perturbed finite state Markov processes
Published: (2002)

Low complexity signal processing and optimal joint detection for over-saturated multiple access communications
Published: (2003)

Coordination in decision-making organizations
Published: (2003)

Migration of control in decision making organizations
Published: (2003)

Coordination in organizations with decision support systems
Published: (2003)

Accuracy and timeliness in decision-making organizations
Published: (2003)

Communication complexity of convex optimization
Published: (2003)

Evaluation of decision aiding in submarine emergency decisionmaking
Published: (2003)

An iterative coordination approach to decentralized decision problems
Published: (2002)

The information-based complexity of dynamic programming
Published: (2003)

The complexity of optimal queueing network control
Published: (2003)

On the communication complexity of distributed algebraic computation
Published: (2003)

Optimum configuration for distributed teams of two decision-makers
Published: (2003)

On the communication complexity of solving a polynominal equation
Published: (2003)

Communication complexity of distributed shortest path algorithms
Published: (2003)

Complexity theoretic aspects of problems in control theory
Published: (2003)

Complexity of stability and controllability of elementary hybrid systems
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2003)

The time complexity of maximum matching by simulated annealing
Published: (2003)

On the average communication complexity of asynchronous distributed algorithms
Published: (2002)

Zero error decision feedback capacity of discrete memoryless channels
Published: (2003)