Centre for Discrete and Applicable Mathematics
	CDAM Research Report, LSE-CDAM-2003-14 August 2003

Abstract

The Lemke-Howson algorithm is the classical algorithm for finding one equilibrium of a bimatrix game. In this paper we present a class of square bimatrix games for which the length of the shortest Lemke-Howson path grows exponentially in the dimension d of the game. We construct the games using pairs of dual cyclic polytopes with 2d facets in dspace.

This paper is obsolete and the improved version Exponentially Many Steps for Finding a Nash Equilibrium in a Bimatrix Game should be considered instead.

Alternatively, if you would like to get a free hard copy of this report, please send the number of this report, LSE-CDAM-2003-14, together with your name and postal address to:

		CDAM Research Reports Series Centre for Discrete and Applicable Mathematics London School of Economics Houghton Street London WC2A 2AE, U.K.
		Phone: +44(0)-20-7955 7732. Fax: +44(0)-20-7955 6877. Email: info@maths.lse.ac.uk

		Introduction to the CDAM Research Report Series.
		CDAM Homepage.

Last changed: Wed 9 Feb 2005
For comments go to: http://www.maths.lse.ac.uk/webmaster.html