Results 1 
5 of
5
Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game
 IN PROCEEDINGS OF THE ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS
, 2004
"... The LemkeHowson algorithm is the classical algorithm for the problem NASH of finding one Nash equilibrium of a bimatrix game. It provides a constructive, elementary proof of existence of an equilibrium, by a typical "directed parity argument", which puts NASH into the complexity class PPA ..."
Abstract

Cited by 47 (1 self)
 Add to MetaCart
(Show Context)
The LemkeHowson algorithm is the classical algorithm for the problem NASH of finding one Nash equilibrium of a bimatrix game. It provides a constructive, elementary proof of existence of an equilibrium, by a typical "directed parity argument", which puts NASH into the complexity class PPAD. This paper presents a class of bimatrix games for which the LemkeHowson algorithm takes, even in the best case, exponential time in the dimension d of the game, requiring #((# 3=4 ) d ) many steps, where # is the Golden Ratio. The "parity argument" for NASH is thus explicitly shown to be inefficient. The games are constructed using pairs of dual cyclic polytopes with 2d suitably labeled facets in dspace.
A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension
 JOURNAL OF THE ACM
, 1985
"... It has been a challenge for mathematicians to confirm theoretically the extremely good performance of simplextype algorithms for linear programming. In this paper the average number of steps performed by a simplex algorithm, the socalled selfdual method, is analyzed. The algorithm is not started ..."
Abstract

Cited by 35 (3 self)
 Add to MetaCart
It has been a challenge for mathematicians to confirm theoretically the extremely good performance of simplextype algorithms for linear programming. In this paper the average number of steps performed by a simplex algorithm, the socalled selfdual method, is analyzed. The algorithm is not started at the traditional point (1,..., but points of the form (1, e, e2,...)T, with t sufficiently small, are used. The result is better, in two respects, than those of the previous analyses. First, it is shown that the expected number of steps is bounded between two quadratic functions cl(min(m, n))' and cz(min(m, n)) ' of the smaller dimension of the problem. This should be compared with the previous two major results in the field. Borgwardt proves an upper bound of 0(n4m1'(n1') under a model that implies that the zero vector satisfies all the constraints, and also the algorithm under his consideration solves only problems from that particular subclass. Smale analyzes the selfdual algorithm starting at (1,..., He shows that for any fixed m there is a constant c(m) such the expected number of steps is less than ~(m)(lnn)&quot;'(&quot;+~); Megiddo has shown that, under Smale's model, an upper bound C(m) exists. Thus, for the first time, a polynomial upper bound with no restrictions (except for nondegeneracy) on the problem is proved, and, for the first time, a nontrivial lower bound of precisely the same order of magnitude is established. Both Borgwardt and Smale require the input vectors to be drawn from
Hardtosolve bimatrix games
 ECONOMETRICA
, 2006
"... The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bimatrix game. This paper presents a class of square bimatrix games for which this algorithm takes, even in the best case, an exponential number of steps in the dimension d of the game. Using polytope theory, th ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
The Lemke–Howson algorithm is the classical method for finding one Nash equilibrium of a bimatrix game. This paper presents a class of square bimatrix games for which this algorithm takes, even in the best case, an exponential number of steps in the dimension d of the game. Using polytope theory, the games are constructed using pairs of dual cyclic polytopes with 2d suitably labeled facets in dspace. The construction is extended to nonsquare games where, in addition to exponentially long Lemke–Howson computations, finding an equilibrium by support enumeration takes on average exponential time.
Challenge instances for NASH
, 2004
"... Abstract. The problem NASH is that of finding one Nash equilibrium of a bimatrix game. The computational complexity of this problem is a longstanding open question. The Lemke–Howson algorithm is the classical algorithm for NASH. In an earlier paper, this algorithm was shown to be exponential, even ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract. The problem NASH is that of finding one Nash equilibrium of a bimatrix game. The computational complexity of this problem is a longstanding open question. The Lemke–Howson algorithm is the classical algorithm for NASH. In an earlier paper, this algorithm was shown to be exponential, even in the best case, for square bimatrix games using dual cyclic polytopes. However the games constructed there are easily solved by another standard method, support enumeration. In this paper we present “challenge instances ” for NASH. We extend the use of dual cyclic polytopes and construct a class of games which are shown to be hard to solve for both the Lemke–Howson algorithm and support enumeration. Other general methods for NASH are discussed. It is not obvious that they could solve these games efficiently. 1