IDEAS home Printed from https://ideas.repec.org/r/eee/gamebe/v63y2008i2p621-641.html

New complexity results about Nash equilibria

Citations

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


Cited by:

  1. 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.
  2. Vipin P. Veetil & Richard E. Wagner, 2015. "Treating Macro Theory as Systems Theory: How Might it Matter?," Advances in Austrian Economics, in: New Thinking in Austrian Political Economy, volume 19, pages 119-143, Emerald Group Publishing Limited.
  3. Theodore T. Allen & Olivia K. Hernand & Abdullah Alomair, 2020. "Optimal Off-line Experimentation for Games," Decision Analysis, INFORMS, vol. 17(4), pages 277-298, December.
  4. Thomas Demuynck, 2014. "The computational complexity of rationalizing Pareto optimal choice behavior," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(3), pages 529-549, March.
  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. Jiang, Albert Xin & Leyton-Brown, Kevin & Bhat, Navin A.R., 2011. "Action-Graph Games," Games and Economic Behavior, Elsevier, vol. 71(1), pages 141-173, January.
  7. Hau Chan & Michael Ceyko & Luis Ortiz, 2017. "Interdependent Defense Games with Applications to Internet Security at the Level of Autonomous Systems," Games, MDPI, vol. 8(1), pages 1-60, February.
  8. George Christodoulou & Martin Gairing & Yiannis Giannakopoulos & Diogo Poças & Clara Waldmann, 2023. "Existence and Complexity of Approximate Equilibria in Weighted Congestion Games," Mathematics of Operations Research, INFORMS, vol. 48(1), pages 583-602, February.
  9. Clempner, Julio B. & Poznyak, Alexander S., 2015. "Computing the strong Nash equilibrium for Markov chains games," Applied Mathematics and Computation, Elsevier, vol. 265(C), pages 911-927.
  10. 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.
  11. Fabrice Talla Nobibon & Laurens Cherchye & Yves Crama & Thomas Demuynck & Bram De Rock & Frits C. R. Spieksma, 2016. "Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms," Operations Research, INFORMS, vol. 64(6), pages 1197-1216, December.
  12. Eleonora Braggion & Nicola Gatti & Roberto Lucchetti & Tuomas Sandholm & Bernhard von Stengel, 2020. "Strong Nash equilibria and mixed strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(3), pages 699-710, September.
  13. Demuynck, Thomas, 2011. "The computational complexity of rationalizing boundedly rational choice behavior," Journal of Mathematical Economics, Elsevier, vol. 47(4-5), pages 425-433.
  14. Amin Dehghanian & Yujia Xie & Nicoleta Serban, 2024. "Identifying Socially Optimal Equilibria Using Combinatorial Properties of Nash Equilibria in Bimatrix Games," INFORMS Journal on Computing, INFORMS, vol. 36(5), pages 1261-1286, September.
  15. Rota Bulò, Samuel & Bomze, Immanuel M., 2011. "Infection and immunization: A new class of evolutionary game dynamics," Games and Economic Behavior, Elsevier, vol. 71(1), pages 193-211, January.
  16. Nicola, Gatti & Mario, Gilli & Fabio, Panozzo, 2016. "Further results on verification problems in extensive-form games," Working Papers 347, University of Milano-Bicocca, Department of Economics, revised 15 Jul 2016.
  17. Matthias Köppe & Christopher Thomas Ryan & Maurice Queyranne, 2011. "Rational Generating Functions and Integer Programming Games," Operations Research, INFORMS, vol. 59(6), pages 1445-1460, December.
  18. McLennan, Andrew & Tourky, Rabee, 2010. "Simple complexity from imitation games," Games and Economic Behavior, Elsevier, vol. 68(2), pages 683-688, March.
  19. Nicola Basilico & Stefano Coniglio & Nicola Gatti & Alberto Marchesi, 2020. "Bilevel programming methods for computing single-leader-multi-follower equilibria in normal-form and polymatrix games," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 3-31, March.
  20. Arturo Macías, 2025. "The Agentic Perspective in Experimental Economics," Games, MDPI, vol. 16(5), pages 1-11, September.
  21. Guzmán, Cristóbal & Riffo, Javiera & Telha, Claudio & Van Vyve, Mathieu, 2022. "A sequential Stackelberg game for dynamic inspection problems," European Journal of Operational Research, Elsevier, vol. 302(2), pages 727-739.
  22. Pranjal Rawat, 2024. "Approximating Auction Equilibria with Reinforcement Learning," Papers 2410.13960, arXiv.org.
  23. Martin Bichler & Nils Kohring & Stefan Heidekrüger, 2023. "Learning Equilibria in Asymmetric Auction Games," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 523-542, May.
  24. Vincent Conitzer, 2019. "The Exact Computational Complexity of Evolutionarily Stable Strategies," Mathematics of Operations Research, INFORMS, vol. 44(3), pages 783-792, August.
  25. Guzman, Cristobal & Riffo, Javiera & Telha, Claudio & Van Vyve, Mathieu, 2021. "A Sequential Stackelberg Game for Dynamic Inspection Problems," LIDAM Discussion Papers CORE 2021036, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  26. Guy Avni & Shibashis Guha & Orna Kupferman, 2018. "An Abstraction-Refinement Methodologyfor Reasoning about Network Games †," Games, MDPI, vol. 9(3), pages 1-21, June.
IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.