Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014 (2014), Article ID 640960, 8 pages
http://dx.doi.org/10.1155/2014/640960
Research Article

A Mixed 0-1 Linear Programming Approach to the Computation of All Pure-Strategy Nash Equilibria of a Finite n-Person Game in Normal Form

1Department of Precision Machinery and Precision Instrumentation, University of Science and Technology of China, Hefei 230026, China
2Department of Systems Engineering and Engineering Management, City University of Hong Kong, Hong Kong
3Department of Engineering, Faculty of Engineering and Science, University of Agder, 4898 Grimstad, Norway
4School of Engineering and Information Technology, University of New South Wales at the Australian Defence Force Academy, Canberra, ACT 2600, Australia

Received 19 January 2014; Accepted 3 March 2014; Published 8 April 2014

Academic Editor: Michael Lütjen

Copyright © 2014 Zhengtian Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. X. Chen and X. Deng, “Settling the complexity of two-player Nash equilibrium,” in Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS '06), pp. 261–270, Berkeley, Calif, USA, October 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. C. Daskalakis, P. W. Goldberg, and C. H. Papadimitriou, “The complexity of computing a Nash equilibrium,” in Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC '06), pp. 71–78, ACM, New York, NY, USA, 2006. View at Publisher · View at Google Scholar · View at MathSciNet
  3. C. E. Lemke and J. T. Howson, “Equilibrium points of bimatrix games,” Journal of the Society for Industrial and Applied Mathematics, vol. 12, pp. 413–423, 1964. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  4. J. Rosenmüller, “On a generalization of the Lemke-Howson algorithm to noncooperative n-person games,” SIAM Journal on Applied Mathematics, vol. 21, pp. 73–79, 1971. View at Publisher · View at Google Scholar · View at MathSciNet
  5. R. Wilson, “Computing equilibria of n-person games,” SIAM Journal on Applied Mathematics, vol. 21, pp. 80–87, 1971. View at Publisher · View at Google Scholar · View at MathSciNet
  6. J. F. Nash, “Equilibrium points in n-person games,” Proceedings of the National Academy of Sciences of the United States of America, vol. 36, pp. 48–49, 1950. View at Publisher · View at Google Scholar · View at MathSciNet
  7. J. F. Nash, “Non-cooperative games,” Annals of Mathematics, vol. 54, no. 2, pp. 286–295, 1951. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. H. Scarf, “The approximation of fixed points of a continuous mapping,” SIAM Journal on Applied Mathematics, vol. 15, pp. 1328–1343, 1967. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. E. L. Allgower and K. Georg, “Piecewise linear methods for nonlinear equations and optimization,” Journal of Computational and Applied Mathematics, vol. 124, no. 1-2, pp. 245–261, 2000. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  10. C. Y. Dang, “The D1-triangulation of Rn for simplicial algorithms for computing solutions of nonlinear equations,” Mathematics of Operations Research, vol. 16, no. 1, pp. 148–161, 1991. View at Publisher · View at Google Scholar · View at MathSciNet
  11. B. C. Eaves, “Homotopies for computation of fixed points,” Mathematical Programming, vol. 3, pp. 1–22, 1972. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  12. C. B. Garcia and W. I. Zangwill, Pathways to Solutions, Fixed Points, and Equilibria, Prentice Hall, Englewood Cliffs, NJ, USA, 1981.
  13. M. Kojima and Y. Yamamoto, “A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm,” Mathematical Programming, vol. 28, no. 3, pp. 288–328, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. G. van der Laan and A. J. J. Talman, “A restart algorithm for computing fixed points without an extra dimension,” Mathematical Programming, vol. 17, no. 1, pp. 74–84, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. M. J. Todd, The Computation of Fixed Points and Applications, vol. 1 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 1976. View at MathSciNet
  16. C. B. Garcia, C. E. Lemke, and H. Luethi, “Simplicial approximation of an equilibrium point of noncooperative n-person games,” Mathematical Programming, vol. 4, pp. 227–260, 1973. View at Google Scholar
  17. T. M. Doup and A. J. J. Talman, “A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices,” Mathematical Programming, vol. 37, no. 3, pp. 319–355, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. T. M. Doup and A. J. J. Talman, “A continuous deformation algorithm on the product space of unit simplices,” Mathematics of Operations Research, vol. 12, no. 3, pp. 485–521, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. G. van der Laan, A. J. J. Talman, and L. van der Heyden, “Simplicial variable dimension algorithms for solving the nonlinear complementarity problem on a product of unit simplices using a general labelling,” Mathematics of Operations Research, vol. 12, no. 3, pp. 377–397, 1987. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  20. A. H. van den Elzen and A. J. J. Talman, “A procedure for finding Nash equilibria in bi-matrix games,” Zeitschrift für Operations Research: Mathematical Methods of Operations Research, vol. 35, no. 1, pp. 27–43, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  21. A. van den Elzen and D. Talman, “An algorithmic approach toward the tracing procedure for bi-matrix games,” Games and Economic Behavior, vol. 28, no. 1, pp. 130–145, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. J. C. Harsanyi, “The tracing procedure: a Bayesian approach to defining a solution for n-person noncooperative games,” International Journal of Game Theory, vol. 4, no. 1-2, pp. 61–94, 1975. View at Publisher · View at Google Scholar · View at MathSciNet
  23. P. J.-J. Herings and A. van den Elzen, “Computation of the Nash equilibrium selected by the tracing procedure in n-person games,” Games and Economic Behavior, vol. 38, no. 1, pp. 89–117, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  24. R. D. McKelvey and A. McLennan, “Computation of equilibria in finite games,” in Handbook of Computational Economics, vol. 1, pp. 87–142, North-Holland, Amsterdam, The Netherlands, 1996. View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. B. Von Stengel, “Computing equilibria for two-person games,” in Handbook of Game Theory with Economic Applications, vol. 3, pp. 1723–1759, 2002. View at Publisher · View at Google Scholar · View at Scopus
  26. J. C. Harsanyi and R. Selten, A General Theory of Equilibrium Selection in Games, vol. 1, MIT Press, Cambridge, Mass, USA, 1988. View at MathSciNet
  27. S. H. Schanuel, L. K. Simon, and W. R. Zame, “The algebraic geometry of games and the tracing procedure,” Game Equilibrium Models, vol. 2, pp. 9–43, 1991. View at Google Scholar
  28. P. J.-J. Herings and R. J. A. P. Peeters, “A differentiable homotopy to compute Nash equilibria of n-person games,” Economic Theory, vol. 18, no. 1, pp. 159–185, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  29. S. Govindan and R. Wilson, “A global Newton method to compute Nash equilibria,” Journal of Economic Theory, vol. 110, no. 1, pp. 65–86, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  30. S. Smale, “A convergent process of price adjustment and global Newton methods,” Journal of Mathematical Economics, vol. 3, no. 2, pp. 107–120, 1976. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  31. P. J.-J. Herings and R. J. A. P. Peeters, “Homotopy methods to compute equilibria in game theory,” Economic Theory, vol. 42, no. 1, pp. 119–156, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. S. Yin, S. X. Ding, A. Haghani, H. Hao, and P. Zhang, “A comparison study of basic data-driven fault diagnosis and process monitoring methods on the benchmark tennessee eastman process,” Journal of Process Control, vol. 22, no. 9, pp. 1567–1581, 2012. View at Publisher · View at Google Scholar
  33. S. Yin, S. X. Ding, A. H. A. Sari, and H. Hao, “Data-driven monitoring for stochastic systems and its application on batch process,” International Journal of Systems Science, vol. 44, no. 7, pp. 1366–1376, 2013. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  34. H. Zhang, Y. Shi, and J. Wang, “On energy-to-peak filtering for nonuniformly sampled nonlinear systems: a Markovian jump system approach,” IEEE Transactions on Fuzzy Systems, vol. 22, no. 1, pp. 212–222, 2014. View at Publisher · View at Google Scholar
  35. S. Yin, H. Luo, and S. Ding, “Real-time implementation of fault-tolerant control systems with performance optimization,” IEEE Transactions on Industrial Electronics, vol. 61, no. 5, pp. 2402–2411, 2013. View at Google Scholar
  36. H. Zhang, X. Zhang, and J. Wang, “Robust gain-scheduling energy-to-peak control of vehicle lateral dynamics stabilisation,” Vehicle System Dynamics, 2014. View at Publisher · View at Google Scholar
  37. M. M. Kostreva and L. A. Kinard, “A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games,” Computers & Mathematics with Applications, vol. 21, no. 6-7, pp. 135–143, 1991. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  38. P. J.-J. Herings and R. J. A. P. Peeters, “A globally convergent algorithm to compute all Nash equilibria for n-person games,” Annals of Operations Research, vol. 137, no. 1, pp. 349–368, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  39. R. S. Datta, “Finding all Nash equilibria of a finite game using polynomial algebra,” Economic Theory, vol. 42, no. 1, pp. 55–96, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  40. T. Sandholm, A. Gilpin, and V. Conitzer, “Mixed-integer programming methods for finding Nash equilibria,” in Proceedings of the 20th National Conference on Artificial Intelligence, pp. 495–501, July 2005. View at Scopus
  41. D. Avis, G. D. Rosenberg, R. Savani, and B. von Stengel, “Enumeration of Nash equilibria for two-player games,” Economic Theory, vol. 42, no. 1, pp. 9–37, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  42. G. Gottlob, G. Greco, and F. Scarcello, “Pure Nash equilibria: hard and easy games,” in Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 215–230, ACM, 2003.
  43. M. Jiang, “Finding pure Nash equilibrium of graphical game via constraints satisfaction approach,” in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, pp. 483–494, Springer, New York, NY, USA, 2007. View at Google Scholar
  44. A. C. Chapman, A. Farinelli, E. M. de Cote, A. Rogers, and N. R. Jennings, “A distributed algorithm for optimising over pure strategy Nash equilibria,” in Proceedings of the 24th AAAI Conference on Artificial Intelligence, pp. 749–755, Atlanta, Ga, USA, July 2010. View at Scopus
  45. G. Gottlob, G. Greco, and T. Mancini, “Complexity of pure equilibria in bayesian games,” in Proceedings of the International Joint Conference on Artificial Intelligence, pp. 1294–1299, 2007.
  46. A. C. Chapman, Control of large distributed systems using games with pure strategy Nash equilibria [Ph.D. thesis], University of Southampton, 2009.
  47. V. Bubelis, “On equilibria in finite games,” International Journal of Game Theory, vol. 8, no. 2, pp. 65–79, 1979. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet