A Computational Approach to Proving Uniqueness in Dynamic Games
Dynamic games are used to analyze dynamic strategic interactions. While existence of equilibrium can often be proved by conventional methods, uniqueness is much more difficult to establish. If a game reduces to solving a system of polynomial equations, then one could use algorithms for finding all solutions to such systems to establish if equilibrium was unique. We study a common type of game where equilibrium can be analyzed as a sequence of small games and apply an all solutions algorithm to each such game
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||11 Nov 2005|
|Date of revision:|
|Contact details of provider:|| Web page: http://comp-econ.org/|
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:sce:scecf5:412. 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 references are entirely missing, you can add them using this form.