Abstract

 
 

References (27)



 


 



Cognitive Biases and the Representative Agent


Elyes Jouini


Universite de Paris 9 Dauphine - CEREMADE

Clotilde Napp


Université Paris-Dauphine - CNRS-DRM

November 24, 2009


Abstract:     
In this paper, we show that behavioral features can be obtained at a group level when the individuals of the group are heterogeneous enough. Starting from a standard model of Pareto optimal allocations, with expected utility maximizers and exponential discounting, but allowing for heterogeneity among individual beliefs and individual time preference rates, we show that the representative agent has an inverse S-shaped probability distortion function and hyperbolic discount rates. As an application of this result, we show that an agent with a probability weighting function as in Cumulative Prospect Theory (resp. an ambiguity averse agent, resp. an hyperbolic discounting agent) may be represented as a collection of agents with noisy beliefs (resp. heterogeneous beliefs, resp. heterogeneous constant discount rates).

Number of Pages in PDF File: 40

Keywords: behavioral agent, hyperbolic discounting, probability weighting function, representative agent, neurofinance, ambiguity aversion

JEL Classification: G11, D81, D84, D87, D03, H43

working papers series


Download This Paper

Date posted: March 12, 2010  

Suggested Citation

Jouini, Elyes and Napp, Clotilde, Cognitive Biases and the Representative Agent (November 24, 2009). Available at SSRN: http://ssrn.com/abstract=1568739 or http://dx.doi.org/10.2139/ssrn.1568739

Contact Information

Elyes Jouini (Contact Author)
Universite de Paris 9 Dauphine - CEREMADE ( email )
Place du Marechal de Lattre de Tassigny
Paris Cedex 16, 75775
France
+ 33 1 44 05 46 75 (Phone)
+ 33 1 44 05 45 99 (Fax)
Clotilde Napp
Université Paris-Dauphine - CNRS-DRM ( email )
Place de Lattre de Tassigny
Paris, 75775
France
Feedback to SSRN (Beta)


Paper statistics
Abstract Views: 290
Downloads: 47
References:  27

© 2013 Social Science Electronic Publishing, Inc. All Rights Reserved.  FAQ   Terms of Use   Privacy Policy   Copyright
This page was processed by apollo5 in 0.360 seconds