A Model of Boundedly Rational Consumer Choice
The paper presents an extended version of the standard textbook problem of consumer choice. As usual, agents have to decide about their desired quantities of various consumption goods, at the same time taking into account their limited budget. Prices for the goods are not fixed but arise from a Walrasian interaction of total demand and a stylized supply function for each of the goods. After showing that this type of model cannot be solved analytically, three different types of evolutionary algorithms are set up to answer the question whether agents' behavior according to the rules of these algorithms can solve the problem of extended consumer choice. There are two important answers to this question: a) The quality of the results learned crucially depends on the elasticity of supply, which in turn is shown to be a measure of the degree of state dependency of the economic problem. b) Statistical tests suggest that for the agents in the model it is relatively easy to adhere to the budget constraint, but that it is relatively difficult to reach an optimum with marginal utility per Dollar being equal for each good.
|Date of creation:||01 Aug 2000|
|Contact details of provider:|| Phone: 1 212 998 3820|
Fax: 1 212 995 4487
Web page: http://www.econometricsociety.org/pastmeetings.asp
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Romer, Paul M, 1986.
"Increasing Returns and Long-run Growth,"
Journal of Political Economy,
University of Chicago Press, vol. 94(5), pages 1002-1037, October.
- Paul M Romer, 1999. "Increasing Returns and Long-Run Growth," Levine's Working Paper Archive 2232, David K. Levine.
- Arifovic, Jasmina, 1994. "Genetic algorithm learning and the cobweb model," Journal of Economic Dynamics and Control, Elsevier, vol. 18(1), pages 3-28, January.
- Chris Birchenhall & Nikos Kastrinos & Stan Metcalfe, 1997. "Genetic algorithms in evolutionary modelling," Journal of Evolutionary Economics, Springer, vol. 7(4), pages 375-393.
- Riechmann, Thomas, 2001. "Genetic algorithm learning and evolutionary games," Journal of Economic Dynamics and Control, Elsevier, vol. 25(6-7), pages 1019-1037, June.
- Thomas Riechmann, 1999. "Learning and behavioral stability An economic interpretation of genetic algorithms," Journal of Evolutionary Economics, Springer, vol. 9(2), pages 225-242.
- Riechmann, Thomas, 1997. "Learning and Behavoiral Stability - An Economic Interpretation of Genetic Algorithms," Hannover Economic Papers (HEP) dp-209, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
- Lucas, Robert Jr., 1988. "On the mechanics of economic development," Journal of Monetary Economics, Elsevier, vol. 22(1), pages 3-42, July. Full references (including those not matched with items on IDEAS)
When requesting a correction, please mention this item's handle: RePEc:ecm:wc2000:0715. 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: (Christopher F. Baum)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.