Dynamic programming approach to discrete time dynamic feedback Stackelberg games with independent and dependent followers
No abstract is available for this item.
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.:
- Chen, Baoline & Zadrozny, Peter A., 2002. "An anticipative feedback solution for the infinite-horizon, linear-quadratic, dynamic, Stackelberg game," Journal of Economic Dynamics and Control, Elsevier, vol. 26(9-10), pages 1397-1416, August.
- Ambler, Steve & Paquet, Alain, 1997.
"Recursive methods for computing equilibria of general equilibrium dynamic Stackelberg games,"
Elsevier, vol. 14(2), pages 155-173, April.
- Steve Ambler & Alain Paquet, 1994. "Recursive Methods for Computing Equilibria of General Equilibrium Dynamic Stackelberg Games," Cahiers de recherche CREFE / CREFE Working Papers 25, CREFE, Université du Québec à Montréal.
- Fruchter, Gila E. & Messinger, Paul R., 2003. "Optimal management of fringe entry over time," Journal of Economic Dynamics and Control, Elsevier, vol. 28(3), pages 445-466, December.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:169:y:2006:i:1:p:310-328. 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: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.