Recursive Methods in Economic Dynamics / Edition 1

Hardcover (Print)
Rent
Rent from BN.com
$43.07
Buy New
Buy New from BN.com
$72.69
(Save 15%)
Used and New from Other Sellers
Used and New from Other Sellers
from $52.62
Usually ships in 1-2 business days
(Save 39%)
Other sellers (Hardcover)
  • All (18) from $52.62   
  • New (9) from $59.90   
  • Used (9) from $52.62   

Overview

This rigorous but brilliantly lucid book presents a self-contained treatment of modern economic dynamics. Stokey, Lucas, and Prescott develop the basic methods of recursive analysis and illustrate the many areas where they can usefully be applied.

After presenting an overview of the recursive approach, the authors develop economic applications for deterministic dynamic programming and the stability theory of first-order difference equations. They then treat stochastic dynamic programming and the convergence theory of discrete-time Markov processes, illustrating each with additional economic applications. They also derive a strong law of large numbers for Markov processes. Finally, they present the two fundamental theorems of welfare economics and show how to apply the methods developed earlier to general equilibrium systems.

The authors go on to apply their methods to many areas of economics. Models of firm and industry investment, household consumption behavior, long-run growth, capital accumulation, job search, job matching, inventory behavior, asset pricing, and money demand are among those they use to show how predictions can he made about individual and social behavior. Researchers and graduate students in economic theory will find this book essential.

Read More Show Less

What People Are Saying

Andrew Caplin
The book is a tour de force. The authors present a unified approach to the techniques and applications of recursive economic theory. The presentations of discrete-time dynamic programming and of Markov processes are authoritative. There is a wide-ranging series of examples drawn from all branches of the discipline, but with special emphasis on macroeconomics. In the short run, the book will be a vital reference in any advanced course in macroeconomic theory. In the long run, it may help to remove the traditional boundaries between microeconomic theory and macroeconomic theory.
Andrew Caplin, Columbia University
Sanford J. Grossman
This book is a wonderful collection of results on the techniques of dynamic programming with great applications to economics written by giants in the field.
Sanford J. Grossman, University of Pennsylvania
Thomas J. Sargent
A magnificent work that is bound to have immense influence on the ways economists think about dynamic systems for many years to come. My own guess is that this book will eventually acquire the stature, say, of Hicks's Value and Capital or Samuelson's Foundations.
Thomas J. Sargent, Hoover Institution

This book is a wonderful collection of results on the techniques of dynamic programming with great applications to economics written by giants in the field.
Read More Show Less
Read More Show Less

Product Details

  • ISBN-13: 9780674750968
  • Publisher: Harvard University Press
  • Publication date: 10/28/1989
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 608
  • Sales rank: 646,365
  • Product dimensions: 6.58 (w) x 9.50 (h) x 1.79 (d)

Meet the Author

Robert E. Lucas, Jr., is John Dewey Distinguished Service Professor of Economics at the University of Chicago. In 1995, he was awarded the Nobel Prize in Economics.

Read More Show Less

Table of Contents

I. THE RECURSIVE APPROACH

1. Introduction


2. An Overview


2.1 A Deterministic Model of Optimal Growth


2.2 A Stochastic Model of Optimal Growth


2.3 Competitive Equilibrium Growth


2.4 Conclusions and Plans

II. DETERMINISTIC MODELS


3. Mathematical Preliminaries


3.1 Metric Spaces and Normed Vector Spaces


3.2 The Contraction Mapping Theorem


3.3 The Theorem of the Maximum


4. Dynamic Programming under Certainty


4.1 The Principle of Optimality


4.2 Bounded Returns


4.3 Constant Returns to Scale


4.4 Unbounded Returns


4.5 Euler Equations


5. Applications of Dynamic Programming under Certainty


5.1 The One-Sector Model of Optimal Growth


5.2 A "Cake-Eating" Problem


5.3 Optimal Growth with Linear Utility


5.4 Growth with Technical Progress


5.5 A Tree-Cutting Problem


5.6 Learning by Doing


5.7 Human Capital Accumulation


5.8 Growth with Human Capital


5.9 Investment with Convex Costs


5.10 Investment with Constant Returns


5.11 Recursive Preferences


5.12 Theory of the Consumer with Recursive Preferences


5.13 A Pareto Problem with Recursive Preferences


5.14 An (s, S) Inventory Problem


5.15 The Inventory Problem in Continuous Time


5.16 A Seller with Unknown Demand


5.17 A Consumption-Savings Problem


6. Deterministic Dynamics


6.1 One-Dimensional Examples


6.2 Global Stability: LiapounovFunctions


6.3 Linear Systems and Linear Approximations


6.4 Euler Equations


6.5 Applications

III. STOCHASTIC MODELS


7. Measure Theory and Integration


7.1 Measurable Spaces


7.2 Measures


7.3 Measurable Functions


7.4 Integration


7.5 Product Spaces


7.6 The Monotone Class Lemma

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)