The Science of Networks 7.1 Today’s topics Sponsored Search Markets Acknowledgements Notes from Nicole Immorlica & Jason Hartline.

Slides:



Advertisements
Similar presentations
Online Ad Auctions By : Hal R. Varian Reviewed By : Sahil Gupta Instructor : Professor Mattmann TA: Kaijan Xu 14/11/2013.
Advertisements

(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Performance Evaluation Sponsored Search Markets Giovanni Neglia INRIA – EPI Maestro 4 February 2013.
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
Economics 100B u Instructor: Ted Bergstrom u T.A. Oddgeir Ottesen u Syllabus online at (Class pages) Or at
Computer-aided mechanism design Ye Fang, Swarat Chaudhuri, Moshe Vardi 1.
Position Auctions with Bidder- Specific Minimum Prices Eyal Even-DarGoogle Jon Feldman Google Yishay Mansour Tel-Aviv Univ., Google S. Muthukrishnan Google.
Bidding Strategy and Auction Design Josh Ruffin, Dennis Langer, Kevin Hyland and Emmet Ferriter.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Ad Auctions: An Algorithmic Perspective Amin Saberi Stanford University Joint work with A. Mehta, U.Vazirani, and V. Vazirani.
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.
1 Internet Advertising and Optimal Auction Design Michael Schwarz Yahoo! Research Keynote Address KDD July 2008.
Selling Billions of Dollars Worth of Keywords Presented By: Mitali Dhoble By Benjamin Edelman, Michael Ostrovsky And Michael Schwarz Reference:
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?
Internet Economics כלכלת האינטרנט Class 5 – Online Advertising 1.
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Game Theory 1. Game Theory and Mechanism Design Game theory to analyze strategic behavior: Given a strategic environment (a “game”), and an assumption.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Sponsored Search Presenter: Lory Al Moakar. Outline Motivation Problem Definition VCG solution GSP(Generalized Second Price) GSP vs. VCG Is GSP incentive.
1. problem set 12 from Binmore’s Fun and Games. p.564 Ex. 41 p.565 Ex. 42.
Algorithmic Applications of Game Theory Lecture 8 1.
Mechanism Design and the VCG mechanism The concept of a “mechanism”. A general (abstract) solution for welfare maximization: the VCG mechanism. –This is.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
Social Networks 101 P ROF. J ASON H ARTLINE AND P ROF. N ICOLE I MMORLICA.
Sponsored Search Auctions 1. 2 Traffic estimator.
FLOWER AUCTIONS IN AMSTERDAM. Ad Auctions March 7, 2008.
FLOWER AUCTIONS IN AMSTERDAM. Ad Auctions March 16, 2007.
Chapter Seventeen Auctions. Who Uses Auctions? u Owners of art, cars, stamps, machines, mineral rights etc. u Q: Why auction? u A: Because many markets.
Mediators in Position Auctions Itai Ashlagi Dov Monderer Moshe Tennenholtz Technion.
Algoritmisk Spilteori Peter Bro Miltersen dPersp, Uge 5, 2. forelæsning.
SIMS Online advertising Hal Varian. SIMS Online advertising Banner ads (Doubleclick) –Standardized ad shapes with images –Normally not related to content.
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.
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
The Economics of Internet Search Hal R. Varian Sept 31, 2007.
HAL R VARIAN FEBRUARY 16, 2009 PRESENTED BY : SANKET SABNIS Online Ad Auctions 1.
Online Advertising and Ad Auctions at Google Vahab Mirrokni Google Research, New York.
Yang Cai Sep 8, An overview of the class Broad View: Mechanism Design and Auctions First Price Auction Second Price/Vickrey Auction Case Study:
A Truthful Mechanism for Offline Ad Slot Scheduling Jon Feldman S. Muthukrishnan Eddie Nikolova Martin P á l.
Multi-Unit Auctions with Budget Limits Shahar Dobzinski, Ron Lavi, and Noam Nisan.
Fall 2006 Davison/LinCSE 197/BIS 197: Search Engine Strategies 14-1 Optimize Your Paid Search Program In this section, we discuss: In this section, we.
Authors: David Robert Martin Thompson Kevin Leyton-Brown Presenters: Veselin Kulev John Lai Computational Analysis of Position Auctions.
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Ad Auctions: Game-Theoretic Perspectives Moshe Tennenholtz Technion—Israel Institute of Technology and Microsoft Research.
How does the market of sponsored links operate? User enters a query The auction for the link to appear on the search results page takes place Advertisements.
Auction Theory Class 9 – Online Advertising 1. Outline Part 1: Bla bla bla Part 2: Equilibrium analysis of Google’s auction 2.
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.
Internet Economics כלכלת האינטרנט Class 7 – Online Advertising 1.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
Combinatorial Auction. A single item auction t 1 =10 t 2 =12 t 3 =7 r 1 =11 r 2 =10 Social-choice function: the winner should be the guy having in mind.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 15 Ýmir Vigfússon.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
Auctions Supplemental Material. In case you haven't noticed: Auctions are Everywhere! eBay → simple auctions for a single item AdWord Auctions → advertisers.
Presented BY SIVA S Zinavo Technologies PAY PER CLICK.
Game Theory: introduction and applications to computer networks Game Theory: introduction and applications to computer networks Introduction Giovanni Neglia.
Comp/Math 553: Algorithmic Game Theory Lecture 10
Mechanism design with correlated distributions
Comp/Math 553: Algorithmic Game Theory Lecture 09
Online Advertising and Ad Auctions at Google
Internet Economics כלכלת האינטרנט
The Structure of Networks
Laddered auction Ashish Goel tanford University
Chapter 4 Bidding for Ad Spaces
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.
Presentation transcript:

The Science of Networks 7.1 Today’s topics Sponsored Search Markets Acknowledgements Notes from Nicole Immorlica & Jason Hartline

Advertising What’s the point of advertising in newspapers and TV? – How are prices for ad time/space determined? 2011 Super Bowl – 30 second ad cost $3 million – 111 million viewers – How are prices determine How are online ads different? – Metrics, targeting, market… How does Google make money? © Kearns

Matching (per keyword) Slot One Slot Two Ad A Ad B Ad C

Matching market A B C SlotsAdvertisers Click-through rates (# of clicks/hour) Value per click 7 6 1

Value of advertiser j for slot i is: v ij = (value per click) x (click-through rate)

Market-clearing matching A B C x (10, 4, 0) = (70, 28, 0) 6 x (10, 4, 0) = (60, 24, 0) 1 x (10, 4, 0) = (10, 4, 0)

Market-clearing prices A B C (= 10 * 4) 7 x (10, 4, 0) = (70, 28, 0) 6 x (10, 4, 0) = (60, 24, 0) 1 x (10, 4, 0) = (10, 4, 0) 40 (= 4 * 1) 4 (= 0 * 0) 0

What if we don’t know values? Run an auction.

Generalized Second Price Auction Each advertiser j announces a bid b j Slot i is assigned to the i th highest bidder at a price per click equal to the (i+1) st highest bidder’s bid

1 2 3 A B C Click-through rates Value Slot i is assigned to the i th highest bidder at a price per click equal to the (i+1) st highest bidder’s bid Bid (per click) Payments: A pays 6*10 = 60B pays 1*4 = 4C pays 0*0 = 0

How should you bid? Experiment: Click-through rates Write your name and your bid on your card. Point total = payoff / A B C Value Bid ? ? 1

Truthful Bidding is Not Necessarily an Equilibrium! (and therefore also not a dominant strategy) If each bidder bids their true valuation, then A gets Slot 1 and her payoff is 7*10-6*10= A B C Click-through rates Value Bid 7 6 5

Truthful Bidding is Not Necessarily an Equilibrium! (and therefore also not a dominant strategy) If A were to bid 5, then she gets Slot 2 and her payoff is 7*4-1*4=24 (which is higher than 10!) A B C Click-through rates Value Bid 5 6 5

Bidder A bids 5, B bids 4 and C bids 1 is an equilibrium Bidder A bids 3, B bids 5 and C bids 1 is also an equilibrium (and it’s not socially optimal, since it assigns B the highest slot A B C Click-through rates Value per click

What are the “nice” equilibria?

“Market-clearing equilibrium” A B C (= 10 * 4) 7 x (10, 4, 0) = (70, 28, 0) 6 x (10, 4, 0) = (60, 24, 0) 1 x (10, 4, 0) = (10, 4, 0) 40 (= 4 * 1) 4 (= 0 * 0) 0 ValueBid > Market-clearing prices/matching  players maximize payoff  no one wants to raise or lower bid

Is There a Way to Encourage Truthful Bidding?

Second Price Sealed Bid Auctions Revisited If bidders values in decreasing order were v 1, v 2, v 3, …, v n Then bidder 1 would win If bidder 1 were not present, the object would go to bidder 2, who values it at v 2 Bidders 2, 3, …, n collectively experience a harm of v 2 because bidder 1 is there

Vickrey-Clarcke-Groves Mechanism Each individual is charged the harm they cause to the rest of the world

First assign items to buyers so as to maximize total valuation What is the harm caused by bidder A’s existence? If bidder A was not there, B would make 60 and C would make 4, which improves their combined valuation by 24. So A has to pay A B C Click- through rates Value per click (70, 28, 0) (60, 24, 0) (10, 4, 0)

What is the harm caused by bidder B’s existence? (70 + 4) – (70 + 0) = 4 What is the harm caused by bidder C’s existence? ( ) – ( ) = A B C Click- through rates Value per click (70, 28, 0) (60, 24, 0) (10, 4, 0)

If items are assigned and prices computed according to the VCG procedure, then truthfully announcing valuations is a dominant strategy for each buyer, and the resulting assignment maximizes the total valuation of any perfect matching of slots and advertisers

The economist as an engineer: Ad quality: ad-dependent click-through rates Click fraud: incentive-based machine learning Bidding language: budgets, slot-dependent bids, enhanced targeting Competing platforms: prevalence of Google’s “mistake”