Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A note on the Lemke-Howson algorithm

1 references·16 citing·33 second hop

FromToDepth

this work references cited by second hop

References

1964Equilibrium Points of Bimatrix Games1,246 cited

Cited by

2006Hard-to-Solve Bimatrix Games130 cited
2009Enumeration of Nash equilibria for two-player games117 cited
2004Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game106 cited
2009Homotopy methods to compute equilibria in game theory104 cited
2008The structure and complexity of Nash equilibria for a selfish routing game89 cited
2002Chapter 45 Computing equilibria for two-person games74 cited
1976Orientation in Complementary Pivot Algorithms69 cited
2003Computing Nash equilibria by iterated polymatrix approximation57 cited
2018Multi-criteria game model based on the pairwise comparisons of strategies with Z-numbers53 cited
1999New Maximal Numbers of Equilibria in Bimatrix Games51 cited
1996Computing equilibria for two person games48 cited
1981Regularity and Stability of Equilibrium Points of Bimatrix Games48 cited
1991A procedure for finding Nash equilibria in bi-matrix games40 cited
2007The approximation complexity of win-lose games38 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

1981

Nash Equilibria for Noncooperative n -Person Games in Normal Form

37 cited

1997A Theorem on the Number of Nash Equilibria in a Bimatrix Game37 cited