CS364A: Algorithmic Game Theory Lecture - Middle Island, New York - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-09-22 16:26:58 Game theory Mechanism design Auction theory Decision theory Gaming Revelation principle Knapsack problem Algorithmic mechanism design Vickrey auction First-price sealed-bid auction Algorithmic game theory Auction		CS364A: Algorithmic Game Theory Lecture #4: Algorithmic Mechanism Design∗ Tim Roughgarden† October 2, Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 198,62 KB Share Document on Facebook

	CS364A: Algorithmic Game Theory Lecture #15: Best-Case and Strong Nash Equilibria∗ Tim Roughgarden† November 11, DocID: 1tO19 - View Document
	CS364A: Algorithmic Game Theory Lecture #20: Mixed Nash Equilibria and PPAD-Completeness∗ Tim Roughgarden† December 4, 2013 Today we continue our study of the limitations of learning dynamics and polynomial-time DocID: 1tNIR - View Document
	CS364A: Algorithmic Game Theory Lecture #18: From External Regret to Swap Regret and the Minimax Theorem∗ Tim Roughgarden† November 20, 2013 DocID: 1tNkR - View Document
	An Algorithmic Game Theory Primer∗ Tim Roughgarden† June 21, 2008 Abstract We give a brief and biased survey of the past, present, and future of research on the interface DocID: 1tNe6 - View Document