Tetris: A study of randomized constraint sampling

MaRDI QIDQ5201298zbMATH OpenFDO

Authors Vivek Farias, Benjamin Van Roy

Publication date 18 April 2006

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• Approximate Dynamic Programming via a Smoothed Linear Program
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• The Linear Programming Approach to Approximate Dynamic Programming
• Feature-based methods for large scale dynamic programming
• Feature-based methods for large scale dynamic programming

Cited in

(8)

• Feature-based methods for large scale dynamic programming
• Approximate dynamic programming for stochastic linear control problems on compact state spaces
• Multi-period portfolio optimization with linear control policies
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• TETRIS IS HARD, EVEN TO APPROXIMATE
• Tetris is Hard, Even to Approximate
• scientific article; zbMATH DE number 6318183 (Why is no real title available?)
• Approximate policy iteration: a survey and some new methods

This page was built for publication: Tetris: A study of randomized constraint sampling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5201298)