Internet Economics כלכלת האינטרנט

Slides:



Advertisements
Similar presentations
An Efficient Dynamic Auction for Heterogeneous Commodities (Lawrence M.Ausubel - september 2000) Authors: Oren Rigbi Damian Goren.
Advertisements

Spectrum Licensing & Auctions Karen Wrege, KB Enterprises, LLC iWeek 2009.
Testing Linear Pricing Algorithms for use in Ascending Combinatorial Auctions (A5) Giro Cavallo David Johnson Emrah Kostem.
Auction Theory Class 5 – single-parameter implementation and risk aversion 1.
The Structure of Networks with emphasis on information and social networks T-214-SINE Summer 2011 Chapter 9 Ýmir Vigfússon.
Combinatorial auctions Vincent Conitzer v( ) = $500 v( ) = $700.
Intermediate Microeconomics Midterm (50%) (4/27) Final (50%) (6/22) Term grades based on relative ranking. Mon 1:30-2:00 ( 社科 757)
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.
What I Really Wanted To Know About Combinatorial Auctions Arne Andersson Trade Extensions Uppsala University.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Internet Economics כלכלת האינטרנט Class 5 – Online Advertising 1.
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
Multi-Unit Auctions 1. Many auctions involve the sale of multiple similar or identical units. Cases of wine at an auction house, carbon permits, shares.
1 Multiunit Auctions Part II Thanks to Larry Ausubel and especially to Peter Cramton for sharing their notes.
Truthful Randomized Mechanisms for Combinatorial Auctions Speaker: Shahar Dobzinski Joint work with Noam Nisan and Michael Schapira.
This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.
Arbitrage in Combinatorial Exchanges Andrew Gilpin and Tuomas Sandholm Carnegie Mellon University Computer Science Department.
Strategic Demand Reduction in homogenous multiunit auctions (where bidders may be interested in more than one unit)
Introduction to Auctions David M. Pennock. Auctions: yesterday Going once, … going twice,...
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:
Multi-Unit Auctions with Budget Limits Shahar Dobzinski, Ron Lavi, and Noam Nisan.
Iterative Combinatorial Auctions David C. Parkes Division Engineering and Applied Sciences Harvard University.
Combinatorial Auctions By: Shai Roitman
1 Ascending Auctions with Package Bidding By Larry Ausubel and Paul Milgrom October 27, 2001 This presentation reports research results. Some of the methods.
Auction Theory תכנון מכרזים ומכירות פומביות Topic 7 – VCG mechanisms 1.
Games People Play. 12: Auctions Games People Play. Auctions In this section we shall learn How different types of auctions allocate goods How to buy.
Auction Theory Class 9 – Multi-unit auctions: part 2 1.
What is the best plan? Peter Cramton (with Larry Ausubel and Paul Milgrom) November 2003.
Slide 1 of 16 Noam Nisan The Power and Limitations of Item Price Combinatorial Auctions Noam Nisan Hebrew University, Jerusalem.
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.
Class 8 – Multi-unit auctions: part 1
Internet Economics כלכלת האינטרנט Class 7 – Online Advertising 1.
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.
مهندسي سيستم‌هاي تجارت الکترونیکی Electronic Commerce System Engineering (ECSE) رشته مهندسي فناوري اطلاعات- گرايش تجارت الکترونیکی دوره کارشناسی ارشد حضوری.
Chapter 14 Lecture – Monopolistic Competition. Monopolistic Competition Large Number of Firms The presence of a large number of firms in the market implies:
Demand and supply analysis – part 1
False-name Bids “The effect of false-name bids in combinatorial
Comp/Math 553: Algorithmic Game Theory Lecture 08
CPS Mechanism design Michael Albert and Vincent Conitzer
Multi-Item Auctions.
Taxation and Market Efficiency
CHAPTER 15 Oligopoly.
Monopolistic Competition
Games for Crowds & Networks
Tuomas Sandholm Computer Science Department Carnegie Mellon University
Monopolistic Competition
Laddered auction Ashish Goel tanford University
Module 9 Quantity Controls Duffka School of Economics 11/7/2018.
Auction Theory.
Game Theory in Wireless and Communication Networks: Theory, Models, and Applications Lecture 6 Auction Theory Zhu Han, Dusit Niyato, Walid Saad, Tamer.
Utility Maximization Ch7
Ascending Auctions with Package Bidding
Monopolistic Competition
Ascending Combinatorial Auctions = a restricted form of preference elicitation in CAs Tuomas Sandholm.
INTERNATIONAL TRADE.
Authors: Oren Rigbi Damian Goren
3.06 Develop A Foundational Knowledge Of Pricing To Understand Its Role In Marketing.
Vincent Conitzer Mechanism design Vincent Conitzer
Vincent Conitzer CPS 173 Mechanism design Vincent Conitzer
Ind – Develop a foundational knowledge of pricing to understand its role in marketing. (Part II) Entrepreneurship I.
Preference elicitation/ iterative mechanisms
Monopolistic Competition
Monopolistic Competition
Auction Theory תכנון מכרזים ומכירות פומביות
CPS Bayesian games and their use in auctions
Class 2 – Revenue equivalence
Presentation transcript:

Internet Economics כלכלת האינטרנט Class 4 – Multi-unit auctions.

Multiple items Goal: design auctions that allow for multiple kinds of items Items are non identical. Examples: Spectrum licenses covering different areas. Baskets of financial assets. Transportation of packages. Advertising campaigns Industrial equipment.

Desired properties What would be desirable properties of such auctions? Auction finds “market clearing” prices. In equilibrium... Auction rules are simple. Robust to collusion, false-name bids, timing manipulations, etc. Tractable: ends in reasonable time, bidders can compute their equilibrium strategies. Bidders should not be expected to process or to report large amounts of data.

Challenges Sealed-bid auctions? Market-clearing prices may not exist Problematic. Bidder preferences may be complex. Market-clearing prices may not exist Especially when items are complements. Bidders do not always know their preference… Determining the preferences is often costly. Do bidders know the equilibrium strategy in the complex auction?

Combinatorial preferences Why shouldn’t we auction each item separately? Auctioning each item alone ignores: complements: v(TV) + v(VCR) < v(TV+VCR) Substitutes: v(TV Toshiba) + v(TV Sony) > v(both TVs) Bidding for packages (or bundles) may increase the efficiency of the auction.

Combinatorial preferences We will next demonstrate the main ideas via a simple model: unit-demand bidders Each bidder wants at most one item (but items are still non-identical) Non identical items: a, b, c, d, e, Each bidder has a value for each item vi(a),vi(b),bi(c),.. Each bidder wants one item only.

Example 10 7 4 8 5 1 What is the VCG outcome? b c Bidder 1 10 7 4 Bidder 2 8 5 Bidder 3 1 What is the VCG outcome? What is the efficient allocation? VCG payment for Bidder 1? Without Bidder 1, others gain 13. With him, they gain 10. p1=3 Similarly, p2=0, p3=3.

Assumptions Seller’s goal: maximize efficiency By law for FCC spectrum auctions. Seller does not know the values of the bidders Here, even no distributional assumptions. “Activity rule” – bidders must send bids constantly, otherwise be removed from the auction. Prevents slow bidding and “sniping”.

Simultaneous Ascending Auction Start with zero prices. Each bidder reports her favorite item Provisional winners are announced. Price of over-demanded items is raised by $1. Following bids by losing bidders. Stop when there are no over-demanded items. Provisional winners become winners. Claim: this auction terminates with: (1) Efficient allocation. (2) VCG prices ( ± $1 )

Example 10 7 4 8 5 1 Let’s run the ascending-price auction now… b c Bidder 1 10 7 4 Bidder 2 8 5 Bidder 3 1 Let’s run the ascending-price auction now… VCG payments: Bidder 1 pays 3 for a Bidder 1 pays 0 for c Bidder 3 pays 3 for b

Spectrum Auctions The ascending auction we saw is called: Simultaneous Ascending Auction Also known in the literature as tatonnement Was introduced in 1994 for spectrum auctions. Revolutionized the sale of spectrum. Has been used since all over the world. The basis of auctions for complex resource allocation problems. Eg, transportation.

Why ascending price auction? Simple and intuitive for bidders “price discovery” – direct the attention of the bidders to the relevant items. No need to determine the value of the other items/bundles. For example: if they see an aggressive competition on one item, which become expensive, they may let it go. Easier to assemble “packages” of items. Decreases the amount of information broadcasted. Again, bidders bid only on items that turn out to be relevant.

Equilibrium in the simultaneous ascending auction Since the auction terminates with the VCG outcome, the auction is truthful. Any deviation that leads to a different outcome will only hurt the bidders (same arguments as before). This is more intuitive way to get to the VCG outcome Analogous to 2nd-price vs. Vickrey.

Market clearing prices Conclusion: In a multi-unit auction with unit-demand bidders: This auction finds “market-clearing prices”: every bidder receives his favorite item (given the prices) all items are allocated (unless their price is 0). The simultaneous ascending auction can be viewed as an intuitive way to reveal market-clearing prices. The allocation that supports market clearing price is always efficient.

Why does it work? For bidders that are interested in one item: the goods are substitutes. If a bidder wants an Apple, and we increase the price of a Banana, the bidder will still demand an Apple. This procedure actually reaches the efficient outcome for more general preferences. As long the items are “substitutes”. Example for complementarities: Spectrum: covering contiguous areas. Acquisition of two firms at the same business

Complementarities What should one do with complementarities? This auction is problematic in the presence of complementarities. Among the reasons: Market clearing price do not exist. Exposure problems. What should one do with complementarities? A problem. Not well understood. Auction uses bundle prices. Or combinations of item and bundle prices. More complex…. The exposure problem has been the driving problem behind many of the innovations in package auction design. Non-synchronous market clearing would be okay if you had a good guess as to later prices. 16

The exposure problem bidders may have to make committing bids early in the auction, when they are uncertain about the eventual cost of the complete package. Think about a new entrant to the spectrum market Needs a certain minimal mass of spectrum to begin. might end up with few very expensive spectrum, but not enough licenses. Resell is not always possible (opponents might have exhausted their budgets, legal problem etc.) Bidders fear of being “exposed” to losses, and this lead to conservative bidding and inefficiencies. The exposure problem has been the driving problem behind many of the innovations in package auction design. Non-synchronous market clearing would be okay if you had a good guess as to later prices. 17

Next week Online advertising How search engines sell ads? How users behave in search engines, and how it affects the ad market?