Optimal mechanisms (part 2) seminar in auctions & mechanism design Presentor : orel levy.

Slides:



Advertisements
Similar presentations
Combinatorial Auction
Advertisements

Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
Blackbox Reductions from Mechanisms to Algorithms.
Yang Cai Sep 24, An overview of today’s class Prior-Independent Auctions & Bulow-Klemperer Theorem General Mechanism Design Problem Vickrey-Clarke-Groves.
Class 4 – Some applications of revenue equivalence
Yang Cai Oct 01, An overview of today’s class Myerson’s Auction Recap Challenge of Multi-Dimensional Settings Unit-Demand Pricing.
On Optimal Single-Item Auctions George Pierrakos UC Berkeley based on joint works with: Constantinos Daskalakis, Ilias Diakonikolas, Christos Papadimitriou,
Approximating optimal combinatorial auctions for complements using restricted welfare maximization Pingzhong Tang and Tuomas Sandholm Computer Science.
CPS Bayesian games and their use in auctions Vincent Conitzer
Mechanism Design, Machine Learning, and Pricing Problems Maria-Florina Balcan.
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Auctions. Strategic Situation You are bidding for an object in an auction. The object has a value to you of $20. How much should you bid? Depends on auction.
Prompt Mechanisms for Online Auctions Speaker: Shahar Dobzinski Joint work with Richard Cole and Lisa Fleischer.
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
Multi-item auctions with identical items limited supply: M items (M smaller than number of bidders, n). Three possible bidder types: –Unit-demand bidders.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
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.
Week 9 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
Yang Cai Oct 15, Interim Allocation rule aka. “REDUCED FORM” : Variables: Interim Allocation rule aka. “REDUCED FORM” : New Decision Variables j.
6.853: Topics in Algorithmic Game Theory Fall 2011 Matt Weinberg Lecture 24.
Yang Cai Sep 17, An overview of today’s class Expected Revenue = Expected Virtual Welfare 2 Uniform [0,1] Bidders Example Optimal Auction.
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.
Yang Cai Sep 24, An overview of today’s class Prior-Independent Auctions & Bulow-Klemperer Theorem General Mechanism Design Problems Vickrey-Clarke-Groves.
Week 10 1 COS 444 Internet Auctions: Theory and Practice Spring 2008 Ken Steiglitz
Combinatorial Auction. Conbinatorial auction t 1 =20 t 2 =15 t 3 =6 f(t): the set X  F with the highest total value the mechanism decides the set of.
Exchanges = markets with many buyers and many sellers Let’s consider a 1-item 1-unit exchange first.
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
Week 61 COS 444 Internet Auctions: Theory and Practice Spring 2009 Ken Steiglitz
Communication Networks A Second Course Jean Walrand Department of EECS University of California at Berkeley.
Static Games of Incomplete Information.. Mechanism design Typically a 3-step game of incomplete info Step 1: Principal designs mechanism/contract Step.
Chapter 19 Equivalence Types of Auctions Strategic Equivalence
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:
VCG Computational game theory Fall 2010 by Inna Kalp and Yosef Heskia.
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.
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.
Market Design and Analysis Lecture 5 Lecturer: Ning Chen ( 陈宁 )
Topic 2: Designing the “optimal auction” Reminder of previous classes: Discussed 1st price and 2nd price auctions. Found equilibrium strategies. Saw that.
Unlimited Supply Infinitely many identical items. Each bidder wants one item. –Corresponds to a situation were we have no marginal production cost. –Very.
Yang Cai Oct 06, An overview of today’s class Unit-Demand Pricing (cont’d) Multi-bidder Multi-item Setting Basic LP formulation.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
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.
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.
Bayesian Algorithmic Mechanism Design Jason Hartline Northwestern University Brendan Lucier University of Toronto.
Advanced Subjects in GT Prepared by Rina Talisman Introduction Revenue Equivalence The Optimal Auction (Myerson 1981) Auctions.
Lecture 4 on Auctions Multiunit Auctions We begin this lecture by comparing auctions with monopolies. We then discuss different pricing schemes for selling.
Comp/Math 553: Algorithmic Game Theory Lecture 10
Comp/Math 553: Algorithmic Game Theory Lecture 11
False-name Bids “The effect of false-name bids in combinatorial
Chapter 4 Bayesian Approximation
Comp/Math 553: Algorithmic Game Theory Lecture 13
Market Design and Analysis Lecture 4
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.
Information, Incentives, and Mechanism Design
Presentation transcript:

Optimal mechanisms (part 2) seminar in auctions & mechanism design Presentor : orel levy

Reminder Quantile Space – the quantile q of an agent with value v ~ F is the probability that the agent is weaker than a random draw from F. q = 1 – F(v) Virtual value – the virtual value of an agent with quantile q and revenue R() is the marginal revenue at q. Revenue curve specifies the revenue as a function of an ex ante probability of sale. R(q) = v(q)q distribution F is regular if its revenue curve R(q) is a concave function of q.

Single – item auctions environments where feasible outcomes serve at most One agent. Our goal is to find a mechanism that optimizes virtual surplus for single-item environments.

Example we will consider the uniform distribution U[0,1]. F(v) = v f(v) = 1

Example Reminder : q = 1 – F(v) R(q) = v(q)q In our example :

Example The uniform distribution U[0,1] is a regular distribution ф (q) R(q)

Example first We will notice that virtual value can be negative If we want to optimize virtual surplus we don’t want to allocate to any agent with negative virtual value. In our case an agent’s virtual value is non negative when his value is at least 1/2 1/2

Example Second we will notice that the virtual surplus is maximized by allocating to the one with the highest virtual value. In our example U[0,1] is regular and in regular distributions the agent with the highest positive virtual value is also the one with the highest value.

Example To optimize virtual surplus and expected revenue we need an auction that will allocate to the agent with the highest value that is at least ½. We will use the second price auction with reserve ½. Definition: the second price auction with reservation price r sells the item if any agent bids above r. the price the winning agent pays is the maximum of the second highest bid and r.

conclusion If F is the uniform distribution U[0,1] then the second price auction with reserve price ½ has the optimal expected revenue. We saw that this optimal revenue is 5/12.

Irregular distributions Definition: an irregular distribution is on for which the revenue curve is non concave. In the case of irregular distribution the virtual valuation function is non monotone, therefore a higher value might result in a lower virtual value.

ironed revenue curves Example : we want to sell an item to alice with ex ante probability q, we will offer the price v(q) to get revenue R(q)=v(q)q Problem: R() is not concave,so this approach may not optimize expected revenue. Solution : we will treat alice the same when her quantile is on some interval [a,b], regardless of her value.

ironed revenue curves R(q) Φ(q)

ironed revenue curves We will replace her exact virtual value with her average virtual value on [a,b].that will flatten the virtual valuation function (ironing). For q [a,b] Ф(q) = const Φ(q)

ironed revenue curves The constant virtual value over [a,b] resolts in a linear revenue curve over [a,b]. Φ(q) R(q)

ironed revenue curves if we treat alice the same on appropriate intervals of quantile space we can construct effective revenue curve Definition : the ironed revenue curve is the smallest concave function that upper-bounds R().and the ironed virtual value function is Ironed intervals are those with Meaning: alice with q ϵ [a,b] that is ironed will be served with the same probability as she would have been with any other q’ ϵ [a,b].

ironed revenue curves The allocation rule is monotone non increasing in quantile.

ironed revenue curves Lemma :an agent’s expected payment is upper- bounded by the expected ironed virtual surplus. Proof:

ironed revenue curves Tow advantages of over 1. We can get more revenue from the ironed revenue curve ( R1(q) > R2(q) E[p1(q)] > E[p2(q)] ) 2. Ironed revenue curve is concave ironed virtual value is monotone ironed virtual surplus maximization results in a monotone allocation rule, so with the appropriate payment rule it is incentive compatible

Optimal mechanisms The ironed virtual surplus maximization mechanism (IVSM): 1. Solicit and accept sealed bids b 2. 3.Calculate payments for each agent from the payment identity

Optimal mechanisms We saw that and are monotone, therefore with The appropriate payments (critical values) truthtelling is a dominant strategy equilibrium. Theorem : the ironed virtual surplus maximization mechanism is dominant strategy incentive compatible. to show that the ironed virtual surplus mechanism is optimal we need to argue that any agent with value within the ironed interval receives the same outcome regardless of where in the interval his value lies.