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

First Page		Document Content
Date: 2009-10-26 07:32:48 Game theory Mathematics Bimatrix game Epsilon-equilibrium Nash equilibrium Zero-sum game Trembling hand perfect equilibrium Best response LemkeHowson algorithm Strategy Pure Continuous game		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 Add to Reading List Source URL: www.math.uni-frankfurt.de Download Document from Source Website File Size: 200,98 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
	Learning Nash equilibria of games via payoff queries John Fearnley1 Paul Goldberg2 DocID: 1pvJj - View Document
	Evolution in Games with Randomly Disturbed Payoffs* Josef Hofbauer Department of Mathematics University College London Gower Street London WC1E 6BT UK DocID: 1p2tJ - View Document
	Atomic congestion games: fast, myopic and concurrent (Invited paper to a special issue of TOCS dedicated to the SAGT’08 best papers) D. Fotakis Dept. of Information and Communication Systems Engineering, U. Aegean, fot DocID: 1p17W - View Document
	Nash Equilibrium Page 1 Nash Equilibrium DocID: 1p0hO - View Document