CS364A: Algorithmic Game Theory Lecture - Price of anarchy - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-09-22 16:38:00 Game theory Mathematics Academia Price of anarchy Nash equilibrium Solution concept Potential game Human behavior		CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013 Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 149,38 KB Share Document on Facebook

	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 DocID: 1tHTW - View Document
	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 DocID: 1rOdn - View Document
	CS364A: Algorithmic Game Theory Lecture #14: Robust Price-of-Anarchy Bounds in Smooth Games∗ Tim Roughgarden† November 6, 2013 DocID: 1riEq - View Document