學門類別
哈佛
- General Management
- Marketing
- Entrepreneurship
- International Business
- Accounting
- Finance
- Operations Management
- Strategy
- Human Resource Management
- Social Enterprise
- Business Ethics
- Organizational Behavior
- Information Technology
- Negotiation
- Business & Government Relations
- Service Management
- Sales
- Economics
- Teaching & the Case Method
最新個案
- A practical guide to SEC ï¬nancial reporting and disclosures for successful regulatory crowdfunding
- Quality shareholders versus transient investors: The alarming case of product recalls
- The Health Equity Accelerator at Boston Medical Center
- Monosha Biotech: Growth Challenges of a Social Enterprise Brand
- Assessing the Value of Unifying and De-duplicating Customer Data, Spreadsheet Supplement
- Building an AI First Snack Company: A Hands-on Generative AI Exercise, Data Supplement
- Building an AI First Snack Company: A Hands-on Generative AI Exercise
- Board Director Dilemmas: The Tradeoffs of Board Selection
- Barbie: Reviving a Cultural Icon at Mattel (Abridged)
- Happiness Capital: A Hundred-Year-Old Family Business's Quest to Create Happiness
Introduction to Dynamic Programming
內容大綱
This technical note introduces dynamic programming (DP), a powerful tool for finding optimal solutions to complex problems that involve a concatenation of multiple decisions. This note assumes some familiarity with decision trees. Compared to decision trees, DP simplifies the problem representation by pooling together similar decision situations, allowing us to apply backward induction in batches by means of the Bellman equation. The note stresses the importance of data to estimate transition probabilities, as well as to proxy the value-to-go in some complex situations. The note includes four exercises, which are supported by spreadsheets for both students and instructors. These cover job search decisions, pricing of American options, and hotel pricing (revenue management).