Game theory, alive: some advanced topics presentation by: Idan Haviv supervised by: Amos Fiat.

Slides:



Advertisements
Similar presentations
Yossi Sheffi Mass Inst of Tech Cambridge, MA ESD.260J/1.260J/15.
Advertisements

(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
Chapter 17: Making Complex Decisions April 1, 2004.
6.896: Topics in Algorithmic Game Theory Lecture 20 Yang Cai.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Class 4 – Some applications of revenue equivalence
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 9 Ýmir Vigfússon.
CPS Bayesian games and their use in auctions Vincent Conitzer
Auctions CS 886 Sept 29, Auctions Methods for allocating goods, tasks, resources... Participants: auctioneer, bidders Enforced agreement between.
Econ 805 Advanced Micro Theory 1 Dan Quint Fall 2007 Lecture 2 – Sept
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
On Cheating in Sealed-Bid Auctions Ryan Porter Yoav Shoham Computer Science Department Stanford University.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Private-value auctions: theory and experimental evidence (Part I) Nikos Nikiforakis The University of Melbourne.
Yang Cai Sep 10, An overview of today’s class Case Study: Sponsored Search Auction Myerson’s Lemma Back to Sponsored Search Auction.
Auction Theory Class 3 – optimal auctions 1. Optimal auctions Usually the term optimal auctions stands for revenue maximization. What is maximal revenue?
Optimal auction design Roger Myerson Mathematics of Operations research 1981.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Sep. 8, 2014 Lirong Xia Introduction to MD (mooncake design or mechanism design)
6.853: Topics in Algorithmic Game Theory Fall 2011 Matt Weinberg Lecture 24.
Algorithmic Applications of Game Theory Lecture 8 1.
Yang Cai Sep 24, An overview of today’s class Prior-Independent Auctions & Bulow-Klemperer Theorem General Mechanism Design Problems Vickrey-Clarke-Groves.
1 Teck-Hua Ho April 18, 2006 Auction Design I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet Pricing.
1 Teck-Hua Ho April 22, 2006 Auction Design I. Economic and Behavioral Foundations of Pricing II. Innovative Pricing Concepts and Tools III. Internet Pricing.
VAMSEE KONERU PRADNYA SUTE
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Auctioning one item PART 2 Tuomas Sandholm Computer Science Department Carnegie Mellon University.
Auctions Hal R. Varian. Auctions Auctions are very useful mean of price discovery eBay: everyone’s favorite example DoveBid: high value asset sales at.
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
Auctions Hal R. Varian. Auctions Auctions are very useful mean of price discovery eBay, everyone’s favorite example DoveBid, high value, not so well.
Yang Cai Sep 15, An overview of today’s class Myerson’s Lemma (cont’d) Application of Myerson’s Lemma Revelation Principle Intro to Revenue Maximization.
and Lecture Notes in Game Theory1 Game Theory Applications: Lecture Notes Course Website u Galina.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Auction Theory Class 2 – Revenue equivalence 1. This class: revenue Revenue in auctions – Connection to order statistics The revelation principle The.
Yang Cai Sep 8, An overview of the class Broad View: Mechanism Design and Auctions First Price Auction Second Price/Vickrey Auction Case Study:
CPS 173 Mechanism design Vincent Conitzer
Multi-Unit Auctions with Budget Limits Shahar Dobzinski, Ron Lavi, and Noam Nisan.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
More on Social choice and implementations 1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A Using slides by Uri.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 21.
Mechanism Design CS 886 Electronic Market Design University of Waterloo.
1 Deterministic Auctions and (In)Competitiveness Proof sketch: Show that for any 1  m  n there exists a bid vector b such that Theorem: Let A f be any.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
By: Amir Ronen, Department of CS Stanford University Presented By: Oren Mizrahi Matan Protter Issues on border of economics & computation, 2002.
Yang Cai Oct 08, An overview of today’s class Basic LP Formulation for Multiple Bidders Succinct LP: Reduced Form of an Auction The Structure of.
Chapter 4 Bayesian Approximation By: Yotam Eliraz & Gilad Shohat Based on Chapter 4 on Jason Hartline’s book Seminar in Auctions and Mechanism.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Regret Minimizing Equilibria of Games with Strict Type Uncertainty Stony Brook Conference on Game Theory Nathanaël Hyafil and Craig Boutilier Department.
Optimal mechanisms (part 2) seminar in auctions & mechanism design Presentor : orel levy.
Steffen Staab 1WeST Web Science & Technologies University of Koblenz ▪ Landau, Germany Network Theory and Dynamic Systems Auctions.
6.853: Topics in Algorithmic Game Theory Fall 2011 Constantinos Daskalakis Lecture 22.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A AAA A AA A.
Comp/Math 553: Algorithmic Game Theory Lecture 10
Comp/Math 553: Algorithmic Game Theory Lecture 11
Bayesian games and their use in auctions
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Chapter 4 Bayesian Approximation
Auction Seminar : Revenue Equivalence
Auctions Lirong Xia. Auctions Lirong Xia Sealed-Bid Auction One item A set of bidders 1,…,n bidder j’s true value vj bid profile b = (b1,…,bn) A sealed-bid.
Bayes Nash Implementation
Information, Incentives, and Mechanism Design
Auction Theory תכנון מכרזים ומכירות פומביות
CPS Bayesian games and their use in auctions
Information, Incentives, and Mechanism Design
Presentation transcript:

Game theory, alive: some advanced topics presentation by: Idan Haviv supervised by: Amos Fiat

Today’s lecture preview  characterization of equilibria  Bidding truthfulness as a dominant strategy  the revelation principle

Reminder:

Assumptions:  For simplicity assume each agent in the auction has one bid. e.g., English Auction  We’ll assume it’s possible to have randomness is the auction itself  for simplicity we’ll lose the subscripts when it’s obvious from context

characterization of equilibria in particular BNE

Take a deep breath…. Any questions?

When is truthfulness dominant? We’ve seen a dominant strategy auction, namely the Vickrey auction (second price, sealed bids), that delivers the same expected revenue to the auctioneer as in a BNE where the item is allocated to the highest bidder. A dominant strategy equilibria is more robust since it doesn’t rely on bidders’ knowledge of the distributions other bidders’ values come from. We are interested in finding out when is bidding truthfully is a dominant strategy.

When is truthfulness dominant? The next theorem characterized bidding truthfully dominant strategy auctions.

When is truthfulness dominant?

Theorem: Proof: similar to part (b) of the previous proof. Notice we haven’t used other bidders’ bid or the distributions their values were taken from

When is truthfulness dominant?

The revelation principle

Questions?

HW Prove part(b) of the first theorem presented using conditions 1,2 from the first part of that theorem.