CS364A: Algorithmic Game Theory Lecture - Bertrand competition - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2015-09-22 16:28:39 Mechanism design Game theory Auction theory Decision theory Gaming Auctions Vickrey auction First-price sealed-bid auction Virtual valuation Auction Incentive compatibility Revelation principle		CS364A: Algorithmic Game Theory Lecture #5: Revenue-Maximizing Auctions∗ Tim Roughgarden† October 7, Add to Reading List Source URL: theory.stanford.edu Download Document from Source Website File Size: 138,77 KB Share Document on Facebook

	CS364A: Algorithmic Game Theory Lecture #5: Revenue-Maximizing Auctions∗ Tim Roughgarden† October 7, DocID: 1rbWw - View Document
	CS364A: Algorithmic Game Theory Lecture #4: Algorithmic Mechanism Design∗ Tim Roughgarden† October 2, DocID: 1r3wI - View Document
	CS364A: Algorithmic Game Theory Lecture #8: Combinatorial and Wireless Spectrum Auctions∗ Tim Roughgarden† October 16, 2013 DocID: 1qSxh - View Document
	The RAND Corporation Strategic Nonparticipation Author(s): Philippe Jehiel and Benny Moldovanu Source: The RAND Journal of Economics, Vol. 27, No. 1 (Spring, 1996), ppPublished by: Blackwell Publishing on behalf DocID: 1qJxb - View Document
	CS364A: Algorithmic Game Theory Lecture #2: Mechanism Design Basics∗ Tim Roughgarden† September 25, DocID: 1qE6n - View Document