<--- Back to Details
First PageDocument Content
Game theory / Mathematics / Bayesian game / Nash equilibrium / Potential game / Solution concept / Price of anarchy / Congestion game / Mechanism design / Minimax / Symmetric game
Date: 2009-12-16 17:13:06
Game theory
Mathematics
Bayesian game
Nash equilibrium
Potential game
Solution concept
Price of anarchy
Congestion game
Mechanism design
Minimax
Symmetric game

C:/Pat_at_portable/latex/EnglishPub/MarkovMbid/latex8.dvi

Add to Reading List

Source URL: netecon.seas.harvard.edu

Download Document from Source Website

File Size: 2,34 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