Advanced Search
MyIDEAS: Login

A Computational Approach to Proving Uniqueness in Dynamic Games

Contents:

Author Info

  • Karl Schmedders
  • Ken Judd

    ()
    (Hoover Institute Hoover Institution)

Abstract

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

Download Info

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
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.

Bibliographic Info

Paper provided by Society for Computational Economics in its series Computing in Economics and Finance 2005 with number 412.

as in new window
Length:
Date of creation: 11 Nov 2005
Date of revision:
Handle: RePEc:sce:scecf5:412

Contact details of provider:
Email:
Web page: http://comp-econ.org/
More information through EDIRC

Related research

Keywords: nash equilibrium; multivariate polynomials;

Find related papers by JEL classification:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Ron N. Borkovsky & Ulrich Doraszelski & Yaroslav Kryukov, . "A User''s Guide to Solving Dynamic Stochastic Games Using the Homotopy Method," GSIA Working Papers 2009-E23, Carnegie Mellon University, Tepper School of Business.
  2. Borkovsky, RON N. & Doraszelski, Ulrich & Kryukov, Yaroslav, 2008. "A User's Guide to Solving Dynamic Stochastic Games Using the Homotopy Method," CEPR Discussion Papers 6733, C.E.P.R. Discussion Papers.
  3. David Besanko & Ulrich Doraszelski, 2005. "Learning-by-Doing, Organizational Forgetting, and Industry Dynanmics," Computing in Economics and Finance 2005 236, Society for Computational Economics.
  4. David Besanko & Ulrich Doraszelski & Yaroslav Kryukov & Mark Satterthwaite, 2008. "Learning-by-Doing, Organizational Forgetting, and Industry Dynamics," GSIA Working Papers 2009-E22, Carnegie Mellon University, Tepper School of Business.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

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 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.