Zihe Wang. Only 1 good Single sell VS Bundle sell Randomization is needed LP method Mechanism characterization.

Slides:



Advertisements
Similar presentations
Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
Advertisements

Combinatorial Auctions with Complement-Free Bidders – An Overview Speaker: Michael Schapira Based on joint works with Shahar Dobzinski & Noam Nisan.
1 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AA A A A.
Real-Time Competitive Environments: Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks Anwar Mohammadi, Nathan Fisher, and Daniel.
Tips for solving bundling problems
Chapter 12 Capturing Surplus.
Testing Linear Pricing Algorithms for use in Ascending Combinatorial Auctions (A5) Giro Cavallo David Johnson Emrah Kostem.
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Network Economics -- Lecture 4: Auctions and applications Patrick Loiseau EURECOM Fall 2012.
Slide 1 of 31 Noam Nisan Approximation Mechanisms: computation, representation, and incentives Noam Nisan Hebrew University, Jerusalem Based on joint works.
Truthful Spectrum Auction Design for Secondary Networks Yuefei Zhu ∗, Baochun Li ∗ and Zongpeng Li † ∗ Electrical and Computer Engineering, University.
Algorithmic mechanism design Vincent Conitzer
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.
Online Mechanism Design (Randomized Rounding on the Fly)
Chapter 6: Prior-free Mechanisms Roee and Ofir (Also from “Envy Freedom and Prior-free Mechanism Design” by Devanur, Hartline, Yan) 1.
On Optimal Single-Item Auctions George Pierrakos UC Berkeley based on joint works with: Constantinos Daskalakis, Ilias Diakonikolas, Christos Papadimitriou,
Prior-free auctions of digital goods Elias Koutsoupias University of Oxford.
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
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
Combinatorial auctions Vincent Conitzer v( ) = $500 v( ) = $700.
An Approximate Truthful Mechanism for Combinatorial Auctions An Internet Mathematics paper by Aaron Archer, Christos Papadimitriou, Kunal Talwar and Éva.
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.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Part 1: Optimal Multi-Item Auctions Constantinos Daskalakis EECS, MIT Reference: Yang Cai, Constantinos Daskalakis and Matt Weinberg: An Algorithmic Characterization.
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.
Algorithmic Applications of Game Theory Lecture 8 1.
Single Parameter Combinatorial Auctions Lei Wang Georgia Institute of Technology Joint work with Gagan Goel Chinmay Karande Google Georgia Tech.
Yang Cai Sep 24, An overview of today’s class Prior-Independent Auctions & Bulow-Klemperer Theorem General Mechanism Design Problems Vickrey-Clarke-Groves.
Limitations of VCG-Based Mechanisms Shahar Dobzinski Joint work with Noam Nisan.
Truthful Randomized Mechanisms for Combinatorial Auctions Speaker: Michael Schapira Joint work with Shahar Dobzinski and Noam Nisan Hebrew University.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Mechanisms for a Spatially Distributed Market Moshe Babaioff, Noam Nisan and Elan Pavlov School of Computer Science and Engineering Hebrew University of.
Interaction of ISPs: Distributed Resource Allocation and Revenue Maximization Sam C.M. Lee, Joe W.J. Jiang, John C.S. Lui The Chinese University of Hong.
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.
Sequences of Take-It-or-Leave-it Offers: Near-Optimal Auctions Without Full Valuation Revelation Tuomas Sandholm and Andrew Gilpin Carnegie Mellon University.
Auction Seminar Optimal Mechanism Presentation by: Alon Resler Supervised by: Amos Fiat.
Combinatorial Auctions By: Shai Roitman
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.
1 Competitive Auctions Authors: A. V. Goldberg, J. D. Hartline, A. Wright, A. R. Karlin and M. Saks Presented By: Arik Friedman and Itai Sharon.
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 ( 陈宁 )
Strategyproof Auctions For Balancing Social Welfare and Fairness in Secondary Spectrum Markets Ajay Gopinathan, Zongpeng Li University of Calgary Chuan.
Optimal mechanisms (part 2) seminar in auctions & mechanism design Presentor : orel levy.
Mechanism Design Ruta Mehta. Game design (not video games!) to achieve a desired goal, like fairness, social welfare maximization, etc.
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.
Decentralized Auctions for Uniformly Semimodular Bidders Mahyar Salek Richard Steinberg MSR Cambridge London School of Economics.
Risk Aversion and Optimal Reserve Prices in First and Second-Price Auctions Audrey Hu University of Amsterdam Stephen A. Matthews University of Pennsylvania.
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
SBBA: a Strongly-Budget-Balanced Double-Auction Mechanism
CPS Mechanism design Michael Albert and Vincent Conitzer
Algebra II Honors Problem of the Day
Comp/Math 553: Algorithmic Game Theory Lecture 14
Market Design and Analysis Lecture 4
Comp/Math 553: Algorithmic Game Theory Lecture 15
Economics and Computation Week #13 Revenue of single Item auctions
Crash Course on Multi-Dimensional Mechanism Design
Vincent Conitzer Mechanism design Vincent Conitzer
-·.-...-· A. -.. ) ,.,.. -.,., · o# --·'1>,.. ·-·-. ·-· ;'/' : ,.,. - ' p ·-·- ·-- 'II"; -.-. t-.. p
Bayes Nash Implementation
Presentation transcript:

Zihe Wang

Only 1 good Single sell VS Bundle sell Randomization is needed LP method Mechanism characterization

Myerson mechanism: The value distribution is uniform on [0,1].The optimal auction is the Vickery auction with reservation price ½. (i)Given the bids v and F, compute virtual value v(v,F) (ii)Run VCG on the virtual bids v, determine the allocation and payment Deterministic!

Naive solution ----Sell single separate good k=2 Consider the distribution taking values 1 and 2 with equal probability ½. The maximum revenue for single good is 1. The maximum revenue for two goods is 2. If we bundle two goods together and sell. Value is additive. The distribution is The maximum revenue is 3*3/4=2.25! Bundle selling is better than single selling /41/21/4

Is the bundle selling always better than single selling? NO! Bundling can also be very bad, while single selling is good! For distribution that takes values 0,1 and 2, each with probability 1/3, the optimal auction can get 13/9 revenue, which is larger than the revenue of 4/3 obtained from either selling the two items separately, or from selling them as a bundle. Optimal auction-----offer to the buyer the choice between any single item at price 2, and the bundle of both items at a discount price of 3.

From Hart&Nisan(2012)

Menu item q1q2s

Menu itemValuation x where the menu item is chosen q1q2s 0.50 (1,0) 012(0,2) 115(3,3)

Menu itemValuation x where the menu item is chosen q1q2s (1,0) (0,2) (3,3) IR on (1,0) IR on (0,2) IC from (3,3) to (1,0) IC from (3,3) to (0,2)

IR on (1,0) IR on (0,2) IC from (3,3) to (1,0) IC from (3,3) to (0,2)

Menu itemValuation x where the menu item is chosen q1q2s

Menu itemValuation x where the menu item is chosen q1q2s