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

	DEFINABLE AND CONTRACTIBLE CONTRACTS MICHAEL PETERS AND BALZS SZENTES Abstract. This paper analyzes a normal form game in which players write contracts that condition their actions on the contracts of the other players. DocID: 1v3xS - View Document
	Chapter Three: Static Games* Game-theoretic modeling often begins with the simplest of structures, either in extensive or in normal form. Such simple structures are meant to define the players, their available actions an DocID: 1roEf - View Document
	Strategic Sophistication of Adolescents: Evidence from Experimental Normal-Form Games DocID: 1rmOS - View Document
	Sophisticated Experience-weighted Attraction Learning and Strategic Teaching in Repeated Games DocID: 1r4Kn - View Document
	CHARACTERISING EQUILIBRIUM SELECTION IN GLOBAL GAMES WITH STRATEGIC COMPLEMENTARITIES CHRISTIAN BASTECK*,◦ ◦ ¨ • DocID: 1qLYq - View Document