A Program for Finding Nash Equilibria
In: Economic and Financial Modeling with Mathematica®
Author
Abstract
Suggested Citation
DOI: 10.1007/978-1-4757-2281-9_7
Download full text from publisher
To our knowledge, this item is not available for download. To find whether it is available, there are three options:1. Check below 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 for a similarly titled item that would be available.
Other versions of this item:
- Todd R. Kaplan & John Dickhaut, "undated". "A Program for Finding Nash Equilibria," Working papers _004, University of Minnesota, Department of Economics.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- is not listed on IDEAS
- Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
- Rahul Savani & Bernhard von Stengel, 2016.
"Unit vector games,"
International Journal of Economic Theory, The International Society for Economic Theory, vol. 12(1), pages 7-27, March.
- von Stengel, Bernhard & Savani, Rahul, 2016. "Unit vector games," LSE Research Online Documents on Economics 65506, London School of Economics and Political Science, LSE Library.
- Dickhaut, John & Kaplan, Todd R & Mukherji, Arijit, 1992. "Strategic information transmission: a mathematica tool for analysis," MPRA Paper 33869, University Library of Munich, Germany.
- Papahristodoulou, Christos, 2012. "Optimal football strategies: AC Milan versus FC Barcelona," MPRA Paper 35940, University Library of Munich, Germany.
- P. Herings & Ronald Peeters, 2005.
"A Globally Convergent Algorithm to Compute All Nash Equilibria for n-Person Games,"
Annals of Operations Research, Springer, vol. 137(1), pages 349-368, July.
- Herings, P.J.J. & Peeters, R.J.A.P., 2002. "A globally convergent algorithm to compute all nash equilibria for n-person games," Research Memorandum 053, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
- Hadi Charkhgard & Martin Savelsbergh & Masoud Talebian, 2018. "Nondominated Nash points: application of biobjective mixed integer programming," 4OR, Springer, vol. 16(2), pages 151-171, June.
- C. Audet & S. Belhaiza & P. Hansen, 2006. "Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games," Journal of Optimization Theory and Applications, Springer, vol. 129(3), pages 349-372, June.
- David Avis & Gabriel Rosenberg & Rahul Savani & Bernhard Stengel, 2010. "Enumeration of Nash equilibria for two-player games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 9-37, January.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4757-2281-9_7. See general information about how to correct material in RePEc.
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.
We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.
Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4757-2281-9_7.html