Approximate Solutions For Partially Observable Stochastic Games with Common Payoffs Rosemary Emery-Montemerlo, Geoff Gordon, Jeff Schneider School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213

First Page		Document Content
Date: 2004-06-25 15:30:50 Stochastic control Bayesian statistics Artificial intelligence Partially observable Markov decision process Bayesian game Action selection Reinforcement learning Markov decision process Decision theory Statistics Dynamic programming Markov processes		Approximate Solutions For Partially Observable Stochastic Games with Common Payoffs Rosemary Emery-Montemerlo, Geoff Gordon, Jeff Schneider School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Add to Reading List Source URL: www.cs.cmu.edu Download Document from Source Website File Size: 179,37 KB Share Document on Facebook

	Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher DocID: 1xTOs - View Document
	Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International DocID: 1vqMk - View Document
	Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain* DocID: 1vouJ - View Document
	MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming DocID: 1vhRF - View Document
	EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples DocID: 1vg0M - View Document