Hard-to-Solve Bimatrix Games

Citations

Cited by:

1. Luciano De Castro, 2012. "Correlation of Types in Bayesian Games," Discussion Papers 1556, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
2. Rahul Savani & Bernhard Stengel, 2015. "Game Theory Explorer: software for the applied game theorist," Computational Management Science, Springer, vol. 12(1), pages 5-33, January.
3. McLennan, Andrew & Tourky, Rabee, 2010. "Imitation games and computation," Games and Economic Behavior, Elsevier, vol. 70(1), pages 4-11, September.
   • Andrew McLennan & Rabee Tourky, 2008. "Imitation Games and Computation," Discussion Papers Series 359, School of Economics, University of Queensland, Australia.
4. Senthil K. Veeraraghavan & Laurens G. Debo, 2011. "Herding in Queues with Waiting Costs: Rationality and Regret," Manufacturing & Service Operations Management, INFORMS, vol. 13(3), pages 329-346, July.
5. Jugal Garg & Ruta Mehta & Vijay V. Vaziranic, 2018. "Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 996-1024, August.
6. Jun Honda, 2015. "Games with the Total Bandwagon Property," Department of Economics Working Papers wuwp197, Vienna University of Economics and Business, Department of Economics.
   • Honda, Jun, 2015. "Games with the Total Bandwagon Property," Department of Economics Working Paper Series 197, WU Vienna University of Economics and Business.
7. Zschocke, Mark S. & Mantin, Benny & Jewkes, Elizabeth M., 2013. "Mature or emerging markets: Competitive duopoly investment decisions," European Journal of Operational Research, Elsevier, vol. 228(3), pages 612-622.
8. M. Ali Khan & Arthur Paul Pedersen & David Schrittesser, 2024. "Two-Person adversarial games are zero-sum: A resolution of the Luce-Raiffa-Aumann (LRA) conjecture," Papers 2403.04029, arXiv.org, revised Mar 2024.
9. Amir Ali Ahmadi & Jeffrey Zhang, 2021. "Semidefinite Programming and Nash Equilibria in Bimatrix Games," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 607-628, May.
10. Xiaotie Deng & Qi Qi & Amin Saberi & Jie Zhang, 2011. "Discrete Fixed Points: Models, Complexities, and Applications," Mathematics of Operations Research, INFORMS, vol. 36(4), pages 636-652, November.
11. Conitzer, Vincent & Sandholm, Tuomas, 2008. "New complexity results about Nash equilibria," Games and Economic Behavior, Elsevier, vol. 63(2), pages 621-641, July.
12. Tim Roughgarden, 2018. "Complexity Theory, Game Theory, and Economics: The Barbados Lectures," Papers 1801.00734, arXiv.org, revised Feb 2020.
13. 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.
14. Sobel, Joel, 2009. "ReGale: Some memorable results," Games and Economic Behavior, Elsevier, vol. 66(2), pages 632-642, July.
15. McLennan, Andrew & Tourky, Rabee, 2008. "Games in oriented matroids," Journal of Mathematical Economics, Elsevier, vol. 44(7-8), pages 807-821, July.
16. Takako Fujiwara-Greve & Carsten Krabbe Nielsen, 2021. "Algorithms may not learn to play a unique Nash equilibrium," Journal of Computational Social Science, Springer, vol. 4(2), pages 839-850, November.
17. Vincent Conitzer, 2019. "The Exact Computational Complexity of Evolutionarily Stable Strategies," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 783-792, August.
18. Srihari Govindan & Robert Wilson, 2010. "A decomposition algorithm for N-player games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 97-117, January.
    • Govindan, Srihari & Wilson, Robert B., 2007. "A Decomposition Algorithm for N-Player Games," Research Papers 1967, Stanford University, Graduate School of Business.
19. Tim Roughgarden, 2010. "Computing equilibria: a computational complexity perspective," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 42(1), pages 193-236, January.
20. Benoit Duvocelle & János Flesch & Hui Min Shi & Dries Vermeulen, 2021. "Search for a moving target in a competitive environment," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(2), pages 547-557, June.
    • Benoit Duvocelle & J'anos Flesch & Hui Min Shi & Dries Vermeulen, 2020. "Search for a moving target in a competitive environment," Papers 2008.09653, arXiv.org, revised Aug 2020.
21. Morales, Dolores Romero & Vermeulen, Dries, 2009. "Existence of equilibria in a decentralized two-level supply chain," European Journal of Operational Research, Elsevier, vol. 197(2), pages 642-658, September.
22. Jun Honda, 2018. "Games with the total bandwagon property meet the Quint–Shubik conjecture," International Journal of Game Theory, Springer;Game Theory Society, vol. 47(3), pages 893-912, September.
23. Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 185-201, June.
24. Guo, Zi-Xuan & He, Jun-Zhou & Li, Qing-Ming & Shi, Lei & Wang, Rui-Wu, 2023. "Asymmetric interaction and diverse forms in public goods production in volunteer dilemma game," Chaos, Solitons & Fractals, Elsevier, vol. 166(C).
25. Bharat Adsul & Jugal Garg & Ruta Mehta & Milind Sohoni & Bernhard von Stengel, 2021. "Fast Algorithms for Rank-1 Bimatrix Games," Operations Research, INFORMS, vol. 69(2), pages 613-631, March.
26. Hwang, Sung-Ha & Rey-Bellet, Luc, 2020. "Strategic decompositions of normal form games: Zero-sum games and potential games," Games and Economic Behavior, Elsevier, vol. 122(C), pages 370-390.
27. Hausken, Kjell, 2008. "Strategic defense and attack for reliability systems," Reliability Engineering and System Safety, Elsevier, vol. 93(11), pages 1740-1750.