Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games
Author
Abstract
Suggested Citation
DOI: 10.1007/s10957-006-9070-3
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Quintas, L G, 1989.
"A Note on Polymatrix Games,"
International Journal of Game Theory, Springer;Game Theory Society, vol. 18(3), pages 261-272.
- L. G. Quintas, 1988. "A Note on Polymatrix Games," Discussion Papers 762, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- C. E. Lemke, 1965. "Bimatrix Equilibrium Points and Mathematical Programming," Management Science, INFORMS, vol. 11(7), pages 681-689, May.
- Keiding, Hans, 1997. "On the Maximal Number of Nash Equilibria in ann x nBimatrix Game," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 148-160, October.
- McKelvey, Richard D. & McLennan, Andrew, 1996. "Computation of equilibria in finite games," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 2, pages 87-142, Elsevier.
- C. Audet & P. Hansen & B. Jaumard & G. Savard, 1997. "Links Between Linear Bilevel and Mixed 0–1 Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 273-300, May.
- 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:
- Fandel, G. & Trockel, J., 2013. "Avoiding non-optimal management decisions by applying a three-person inspection game," European Journal of Operational Research, Elsevier, vol. 226(1), pages 85-93.
- Deng, Xinyang & Jiang, Wen & Wang, Zhen, 2019. "Zero-sum polymatrix games with link uncertainty: A Dempster-Shafer theory solution," Applied Mathematics and Computation, Elsevier, vol. 340(C), pages 101-112.
- Gabriele Dragotto & Rosario Scatamacchia, 2023. "The Zero Regrets Algorithm: Optimizing over Pure Nash Equilibria via Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 1143-1160, September.
- S. Belhaiza & S. Charrad & R. M’Hallah, 2018. "On the Performance of Managers and Controllers: A Polymatrix Game Approach for the Manager–Controller–Board of Directors’ Conflict," Journal of Optimization Theory and Applications, Springer, vol. 177(2), pages 584-602, May.
- Renato Soeiro & Alberto A. Pinto, 2022. "A Note on Type-Symmetries in Finite Games," Mathematics, MDPI, vol. 10(24), pages 1-13, December.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002.
"Computing Normal Form Perfect Equilibria for Extensive Two-Person Games,"
Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 2002. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 9f112346-b587-47f3-ad2e-6, Tilburg University, School of Economics and Management.
- Porter, Ryan & Nudelman, Eugene & Shoham, Yoav, 2008. "Simple search methods for finding a Nash equilibrium," Games and Economic Behavior, Elsevier, vol. 63(2), pages 642-662, July.
- Govindan, Srihari & Wilson, Robert, 2004. "Computing Nash equilibria by iterated polymatrix approximation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1229-1241, April.
- Bernhard von Stengel & Antoon van den Elzen & Dolf Talman, 2002.
"Computing Normal Form Perfect Equilibria for Extensive Two-Person Games,"
Econometrica, Econometric Society, vol. 70(2), pages 693-715, March.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Research Memorandum 752, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 2002. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 9f112346-b587-47f3-ad2e-6, Tilburg University, School of Economics and Management.
- von Stengel, B. & van den Elzen, A.H. & Talman, A.J.J., 1997. "Computing normal form perfect equilibria for extensive two-person games," Other publications TiSEM 4487e2bf-5bc1-47d3-819f-2, Tilburg University, School of Economics and Management.
- P. Herings & Ronald Peeters, 2010.
"Homotopy methods to compute equilibria in game theory,"
Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 119-156, January.
- Herings, P.J.J. & Peeters, R.J.A.P., 2006. "Homotopy methods to compute equilibria in game theory," Research Memorandum 046, 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.
- 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.
- Peter Miltersen & Troels Sørensen, 2010. "Computing a quasi-perfect equilibrium of a two-player game," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 175-192, January.
- P. Giovani Palafox-Alcantar & Dexter V. L. Hunt & Chris D. F. Rogers, 2020. "A Hybrid Methodology to Study Stakeholder Cooperation in Circular Economy Waste Management of Cities," Energies, MDPI, vol. 13(7), pages 1-30, April.
- Zhang, Bin, 2012. "Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints," European Journal of Operational Research, Elsevier, vol. 218(2), pages 426-434.
- Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2013. "An efficient compact quadratic convex reformulation for general integer quadratic programs," Computational Optimization and Applications, Springer, vol. 54(1), pages 141-162, January.
- C. Audet & G. Savard & W. Zghal, 2007. "New Branch-and-Cut Algorithm for Bilevel Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 134(2), pages 353-370, August.
- Talman, A.J.J. & van der Heyden, L., 1981.
"Algorithms for the linear complementarity problem which allow an arbitrary starting point,"
Research Memorandum
FEW 99, Tilburg University, School of Economics and Management.
- Talman, A.J.J. & Van der Heyden, L., 1983. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Other publications TiSEM ececdefe-89ec-4a8a-8a2d-8, Tilburg University, School of Economics and Management.
- Dolf A.J.J. Talman & Ludo Van der Heyden, 1981. "Algorithms for the Linear Complementarity Problem Which Allow an Arbitrary Starting Point," Cowles Foundation Discussion Papers 600, Cowles Foundation for Research in Economics, Yale University.
- Talman, A.J.J. & van der Heyden, L., 1981. "Algorithms for the linear complementarity problem which allow an arbitrary starting point," Other publications TiSEM 2aca8cbf-e8c5-4e8f-b6da-d, Tilburg University, School of Economics and Management.
- Cao, Dong & Chen, Mingyuan, 2006. "Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach," European Journal of Operational Research, Elsevier, vol. 169(1), pages 97-110, February.
- Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
- Richard Asmuth, 1978. "Studying Economic Equilibria on Affine Networks Via Lemke's Algorithm," Discussion Papers 314, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Gilbert Laffond & Jean-François Laslier & Michel Breton, 2000.
"K–Player Additive Extension of Two-Player games with an Application to the Borda Electoral Competition Game,"
Theory and Decision, Springer, vol. 48(2), pages 129-137, March.
- Laffond, G. & Laslier, J.F. & LeBreton, M., 1995. "K-Players Additive Extensions of Two-player Games with an Application to the Borda Electoral Competition Game," G.R.E.Q.A.M. 95a17, Universite Aix-Marseille III.
- Ron N. Borkovsky & Ulrich Doraszelski & Yaroslav Kryukov, 2010. "A User's Guide to Solving Dynamic Stochastic Games Using the Homotopy Method," Operations Research, INFORMS, vol. 58(4-part-2), pages 1116-1132, August.
- 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).
- S. Dempe & S. Franke, 2016. "On the solution of convex bilevel optimization problems," Computational Optimization and Applications, Springer, vol. 63(3), pages 685-703, April.
More about this item
Keywords
Bimatrix games; polymatrix games; Nash equilibria; extreme equilibria; enumeration;All these keywords.
Statistics
Access and download statisticsCorrections
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:joptap:v:129:y:2006:i:3:d:10.1007_s10957-006-9070-3. 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.
If CitEc recognized a bibliographic reference but did not link an item in RePEc 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 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.