<--- Back to Details
First PageDocument Content
Game theory / Epsilon-equilibrium / Nash equilibrium / Evolutionary game theory / Potential game / Best response / Normal-form game / Strategy / Stochastic game / Risk dominance
Date: 2005-07-29 09:44:34
Game theory
Epsilon-equilibrium
Nash equilibrium
Evolutionary game theory
Potential game
Best response
Normal-form game
Strategy
Stochastic game
Risk dominance

Evolution in Games with Randomly Disturbed Payoffs* Josef Hofbauer Department of Mathematics University College London Gower Street London WC1E 6BT UK

Add to Reading List

Source URL: www.ssc.wisc.edu

Download Document from Source Website

File Size: 3,35 MB

Share Document on Facebook

Similar Documents

The complete KublaCon Guide to helping create the best game convention West of the M ississippi  Required reading for current and potential KublaCon Volunteers: Hosts, GMs, and Judges. Learn how to make the best of your

The complete KublaCon Guide to helping create the best game convention West of the M ississippi Required reading for current and potential KublaCon Volunteers: Hosts, GMs, and Judges. Learn how to make the best of your

DocID: 1u31U - View Document

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria∗ Tim Roughgarden† November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria∗ Tim Roughgarden† November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

DocID: 1tHTW - View Document

Games, Ethics and Engagement: Potential Consequences of Civicminded Game Design and Gameplay Sharman	Siebenthal	Adams	 University	of	Michigan-Flint,	USA

Games, Ethics and Engagement: Potential Consequences of Civicminded Game Design and Gameplay Sharman Siebenthal Adams University of Michigan-Flint, USA

DocID: 1tG1J - View Document

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria∗ Tim Roughgarden† November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

CS364A: Algorithmic Game Theory Lecture #13: Potential Games; A Hierarchy of Equilibria∗ Tim Roughgarden† November 4, 2013 Last lecture we proved that every pure Nash equilibrium of an atomic selfish routing

DocID: 1rOdn - View Document

CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013

CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013

DocID: 1riEq - View Document