Revisiting Asset Pricing Puzzles in an Exchange Economy
We show that several well-known asset pricing puzzles are largely mitigated if we endow the representative agent with an arbitrarily small minimum consumption level. This allows us to solve the model for parameter values where the standard "Lucas tree" model is not defined. For these parameters, disasters become more important, and the market risk premium therefore higher, even though consumption is less risky. Our model yields reasonable risk premia, Sharpe ratios, and discount rates; excess price volatility; and a high market price-dividend ratio. We derive closed-form solutions for all variables of interest. The Author 2011. Published by Oxford University Press on behalf of The Society for Financial Studies. All rights reserved. For Permissions, please e-mail: firstname.lastname@example.org., Oxford University Press.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 24 (2011)
Issue (Month): 3 ()
|Contact details of provider:|| Postal: Oxford University Press, Journals Department, 2001 Evans Road, Cary, NC 27513 USA.|
Web page: http://www.rfs.oupjournals.org/
More information through EDIRC
|Order Information:||Web: http://www4.oup.co.uk/revfin/subinfo/|
When requesting a correction, please mention this item's handle: RePEc:oup:rfinst:v:24:y:2011:i:3:p:629-674. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.