McLennan, AndrewPark, In-Uck2009-12-182009-12-181997-04McLennan, A. and Park, I., (1997), "Generic 4 x 4 Two Person Games Have At Most 15 Nash Equilibria", Discussion Paper No. 300, Center for Economic Research, Department of Economics, University of Minnesota.https://hdl.handle.net/11299/55850The maximal generic number of Nash equilibria for two person games in which the two agents each have four pure strategies is shown to be 15. In contrast to Keiding (1995), who arrives at this result by computer enumeration, our argument is based on a collection of lemmas that constrain the set of equilibria. Several of these pertain to any common number d of pure strategies for the two agents.en-USC72Working Paper