Single-leader-multiple-follower games with boundedly rational agents
This paper studies a class of hierarchical games called single-leader-multiple-follower games (SLMFGs) that have important applications in economics and engineering. We consider such games in the context of boundedly rational agents that are limited in the information and computational power they may possess. Agents in our SLMFG are modeled as adaptive learners that use simple reinforcement learning schemes to learn their optimal behavior. The proposed learning approach is illustrated using a well-studied problem in economics. It is shown that with a patiently learning leader the repeated plays of the game result in approximate equilibrium outcomes.
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.
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.:
- Kalai, Ehud & Ledyard, John, 1997.
1027, California Institute of Technology, Division of the Humanities and Social Sciences.
- Waltman, Ludo & Kaymak, Uzay, 2008. "Q-learning agents in a Cournot oligopoly model," Journal of Economic Dynamics and Control, Elsevier, vol. 32(10), pages 3275-3293, October.
- repec:att:wimass:9530 is not listed on IDEAS
- Groves, Theodore, 1973. "Incentives in Teams," Econometrica, Econometric Society, vol. 41(4), pages 617-31, July.
- Kutschinski, Erich & Uthmann, Thomas & Polani, Daniel, 2003. "Learning competitive pricing strategies by multi-agent reinforcement learning," Journal of Economic Dynamics and Control, Elsevier, vol. 27(11-12), pages 2207-2218, September.
- Drew Fudenberg & David K. Levine, 1998.
"The Theory of Learning in Games,"
MIT Press Books,
The MIT Press,
edition 1, volume 1, number 0262061945, June.
- Vallee, Thomas & Basar, Tamer, 1999. "Off-Line Computation of Stackelberg Solutions with the Genetic Algorithm," Computational Economics, Society for Computational Economics, vol. 13(3), pages 201-09, June.
- Radner, Roy, 1985. "Repeated Principal-Agent Games with Discounting," Econometrica, Econometric Society, vol. 53(5), pages 1173-98, September.
- Kutschinski, Erich & Uthmann, Thomas & Polani, Daniel, 2003. "Learning competitive pricing strategies by multi-agent reinforcement learning," Journal of Economic Dynamics and Control, Elsevier, vol. 27(11), pages 2207-2218.
- William A. Brock & Cars H. Hommes, 1997.
"A Rational Route to Randomness,"
Econometric Society, vol. 65(5), pages 1059-1096, September.
When requesting a correction, please mention this item's handle: RePEc:eee:dyncon:v:33:y:2009:i:8:p:1593-1603. 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: (Zhang, Lei)
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.