Computation of completely mixed equilibrium payoffs in bimatrix games

First Page		Document Content
Date: 2012-06-24 02:05:21 Game theory Bimatrix game LemkeHowson algorithm Best response Zero-sum game Matching pennies Strategy Normal-form game Risk dominance Symmetric game		Computation of completely mixed equilibrium payoffs in bimatrix games Add to Reading List Source URL: faculty.biu.ac.il Download Document from Source Website File Size: 169,53 KB Share Document on Facebook

	GAMES OF FIXED RANK: A HIERARCHY OF BIMATRIX GAMES RAVI KANNAN AND THORSTEN THEOBALD Abstract. We propose and investigate a hierarchy of bimatrix games (A, B), whose (entry-wise) sum of the pay-off matrices of the two pl DocID: 1qcFC - View Document
	The Complexity of Computing the Solution Obtained by a Specific Algorithm Paul W. Goldberg Department of Computer Science University of Oxford, U. K. DocID: 1q2Cn - View Document
	Computation of completely mixed equilibrium payoffs in bimatrix games DocID: 1pzpd - View Document
	New Lower Bounds for the Number of Equilibria in Bimatrix Games Bernhard von Stengel ∗ ETH Z¨ urich DocID: 1ocaT - View Document
	Computing Equilibria for Two-Person Games Bernhard von Stengel ETH Z¨ urich November 25, 1996 (minor corrections added November 11, 1997) DocID: 1o3xI - View Document