Crowding Games are Sequentially Solvable

First Page		Document Content
Date: 2012-06-23 16:23:30 Game theory Mathematics Nash equilibrium Subgame perfect equilibrium Subgame Trembling hand perfect equilibrium Extensive-form game Backward induction Potential game Normal-form game Folk theorem		Crowding Games are Sequentially Solvable Add to Reading List Source URL: faculty.biu.ac.il Download Document from Source Website File Size: 138,93 KB Share Document on Facebook

	Multiagent Planning with Trembling-hand Perfect Equilibrium in Multiagent POMDPs Yuichi YABU, Makoto YOKOO, and Atsushi IWASAKI Graduate School of ISEE, Kyushu University, 744 Motooka, Nishi-ku, Fukuoka, , Japan DocID: 1sIRh - 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
	Discussion Paper NoBelieving when Credible: Talking about Future Plans and Past Actions Karl H. Schlag* Péter Vida** DocID: 1r9KP - View Document
	Crowding Games are Sequentially Solvable DocID: 1qGcr - View Document
	Infinitely Repeated Games with Discounting Page 1 Infinitely Repeated Games with Discounting DocID: 1qFi3 - View Document