This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions.

Slides:



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

1 Private Value Auctions There will be five bidding groups. I will give each bidding group a value estimate. The estimates will be distributed as X-2000,
(Single-item) auctions Vincent Conitzer v() = $5 v() = $3.
Private Information and Auctions. Auction Situations Private Value – Everybody knows their own value for the object – Nobody knows other peoples values.
Chapter 17: Making Complex Decisions April 1, 2004.
Oligopoly.
CPS Bayesian games and their use in auctions Vincent Conitzer
Market Institutions: Oligopoly
Chapter 25: Auctions and Auction Markets 1 Auctions and Auction Markets.
Bidding Strategy and Auction Design Josh Ruffin, Dennis Langer, Kevin Hyland and Emmet Ferriter.
Auctions Auction types: –First price, sealed bid auction –Second price, sealed bid auction –English auction (ascending bid auction) –Dutch auction (descending.
Michael R. Baye, Managerial Economics and Business Strategy, 3e. ©The McGraw-Hill Companies, Inc., 1999 Managerial Economics & Business Strategy Chapter.
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.
Game Theory “A cynic knows the price of everything and the value of nothing” - Oscar Wilde, Lady Windemere’s Fan Mike Shor Lecture 11.
Welcome Auctions Jonathan D. Wareham
1 Chapter 6: Auctions SCIT1003 Chapter 6: Auctions Prof. Tsang.
Auction. Types of Auction  Open outcry English (ascending) auction Dutch (descending) auction  Sealed bid First-price Second-price (Vickrey)  Equivalence.
Do software agents know what they talk about? Agents and Ontology dr. Patrick De Causmaecker, Nottingham, March
Auctions Ruth Tarrant. Classifying auctions What is the nature of the good being auctioned? What are the rules of bidding? Private value auction Common.
The Economics of Information
The Science of Networks 6.1 Today’s topics Game Theory Normal-form games Dominating strategies Nash equilibria Acknowledgements Vincent Conitzer, Michael.
Avoiding the Bertrand Trap II: Cooperation. How do Coke & Pepsi Make Money? Coke and Pepsi sell essentially undifferentiated products Prices are widely.
Game Theory “Доверяй, Но Проверяй” - Russian Proverb (Trust, but Verify) - Ronald Reagan Mike Shor Lecture 6.
Game Theory “Доверяй, Но Проверяй” (“Trust, but Verify”) - Russian Proverb (Ronald Reagan) Topic 5 Repeated Games.
1 Industrial Organization Collusion Univ. Prof. dr. Maarten Janssen University of Vienna Summer semester Week 17.
Game Theory. Games Oligopolist Play ▫Each oligopolist realizes both that its profit depends on what its competitor does and that its competitor’s profit.
Industrial Organization - Matilde Machado Tacit Collusion Tacit Collusion Matilde Machado.
Strategic Decisions Making in Oligopoly Markets
Simultaneous games with continuous strategies Suppose two players have to choose a number between 0 and 100. They can choose any real number (i.e. any.
CHAPTER 9 Basic Oligopoly Models Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
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.
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.
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
Semester Review  Review Class Concepts -Decision Trees -Expected Value & Present Value -Sensitivity & Additional Info -Costs -Types: OH, Fixed, Variable,
Managerial Economics & Business Strategy
and Lecture Notes in Game Theory1 Game Theory Applications: Lecture Notes Course Website u Galina.
This Week’s Topics  Review Class Concepts -Sequential Games -Simultaneous Games -Bertrand Trap -Auctions  Review Homework  Practice Problems.
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,...
Introduction to Game Theory
Chapter 12 Choices Involving Strategy Copyright © 2014 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written.
© 2009 Institute of Information Management National Chiao Tung University Lecture Note II-3 Static Games of Incomplete Information Static Bayesian Game.
ECO290E: Game Theory Lecture 12 Static Games of Incomplete Information.
Combinatorial Auctions By: Shai Roitman
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.
McGraw-Hill/Irwin Copyright  2008 by The McGraw-Hill Companies, Inc. All rights reserved. GAME THEORY, STRATEGIC DECISION MAKING, AND BEHAVIORAL ECONOMICS.
Auctions and Bidding. 2 Auction Theory Auction theory is important for practical reason empirical reason –testing-ground for economic theory, especially.
4. The Theories and the Real World. Strategic Behavior in Business and Econ Outline 1. Introduction 2. Individual Decision Making 3. Basic Topics in Game.
Auctions Shyam Sunder, Yale University Kozminski Academy Warsaw, June 22, 2013.
Pricing in Imperfectly Competitive Markets. Determinants of Pricing Decision Economic analysis of pricing in imperfectly competitive markets identifies.
CHAPTER 15 Oligopoly PowerPoint® Slides by Can Erbil © 2004 Worth Publishers, all rights reserved.
Auctions serve the dual purpose of eliciting preferences and allocating resources between competing uses. A less fundamental but more practical reason.
1 The Dynamics of Pricing Rivalry Besanko, Dranove, Shanley, and Schaefer Chapters 8.
Auctions Great Lakes Institute of Management, Chennai March 4, 2012.
Econ 545, Spring 2016 Industrial Organization Anticompetitive actions: Cartels and collusion.
Oligopoly and Game Theory Topic Students should be able to: Use simple game theory to illustrate the interdependence that exists in oligopolistic.
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.
MANAGERIAL ECONOMICS 12th Edition
Oligopoly. Some Oligopolistic Industries Economics in Action - To get a better picture of market structure, economists often use the “four- firm concentration.
1 Types of Auctions English auction –ascending-price, open-outcry Dutch auction –descending-price, open-outcry 1 st price sealed bid auction –known as.
ECONOMICS FOR BUSINESS (MICROECONOMICS) Lesson 5
Strategic Decision Making in Oligopoly Markets
Microeconomics 1000 Lecture 13 Oligopoly.
Game Theory Fall Mike Shor Topic 5.
Game Theory Spring Mike Shor Topic 5.
Presentation transcript:

This Week’s Topics  Review Class Concepts -Auctions, continued -Repeated Games -Bertrand Trap & Anti-Trust -Auctions

Class Concepts – Auctions  Auctions -One-time auction for a single item -English Auction – Ascending bid auction. The item goes to the last party to bid. -Strategy: When to drop out  What is your WTP? -Dutch Auction – Descending bid auction. The item goes to the first party to bid. -Strategy: When to start bidding  What is your WTP? -First-Price Sealed Bid – All interested parties submit a price. The item goes to the party with the highest bid, at the price he/she submitted. -Strategy: What price to submit  Survey the competition -Second-Price Sealed Bid – All interested parties submit a price. The item goes to the party with the highest bid, at the price of the second highest bid submitted. -Strategy: What price to submit  Survey the competition

Class Concepts – Auctions  Auction Strategies and Terms -For the English Auction and Second-Price Sealed Bid – Bid your willingness to pay! -English Auction Dominant Strategy – Drop out when the bidding exceeds your WTP -Second-Price Sealed Bid Dominant Strategy – Write down and submit your WTP -For the Dutch Auction and First-Price Sealed Bid – Bid below your willingness to pay! -There is no dominant strategy -Your strategy depends on what you believe your competitors are willing to pay -If all bidders are risk neutral then all four bidding rules produce the same expected revenue to the seller. -Private Value (certainty) – You know the value of the auction with certainty. Your value is independent of others’ value. You want to win the auction at any price less than your value. (For Dutch & First-Price Sealed Bid, more bidders  shade less) -Common Value (uncertainty) – You do not know the actual value of the auction (you have an estimate or expected value). The actual value to the item is estimated by all participants. Regardless of auction type: -Your dominant strategy changes and you should shade your bid to avoid the winner’s curse: More bidders  shade more -Learn all you can about your competitor’s WTP. You are all estimating the same value and your bids should be distributed around that value. Your goal is not winning the auction, you want to avoid paying more than the item is worth.

Class Concepts – Auctions  Auctions -So, in summary… -Problem Set 5, Question 2 -a) Certain your profits are $2M, second price sealed bid  Bid your WTP -b) Under second price sealed bid, no benefit from knowing your opponents’ WTP -c) With first price sealed bid, you would benefit from knowing your opponents’ WTP -d) Uncertain profits are $2M, you should shade your bid to avoid the winners’ curse -e) You would benefit from knowing your competitors WTP because you could estimate profits better.

Class Concepts – Repeated Games  Repeated Games -Repeated Games are those with simultaneous decisions over an infinite number of interactions or no known ending point. -Games with simultaneous decisions and a finite number of interactions are sequential games. They should be solved using backward induction, and not the strategies discussed here.  Strategies for Repeated Games -Goal: Sustain price moderation (and higher payoffs) to both firms, even though this is not an equilibrium solution to the simultaneous game -Grim Strategy – Price at the optimal industry price. If an opponent cheats and prices lower, punish them by pricing at marginal cost forever. -t-period Trigger Strategy – Price at the optimal industry price. If an opponent cheats and prices lower, price at marginal cost for the next “t” periods. Then return to the optimal industry price. -Tit for Tat Strategy – Price at the optimal industry price. If an opponent cheats and prices lower, then price at marginal cost in the subsequent period.

Class Concepts – Repeated Games  Repeated Game Strategy Evaluation -Let High Profits = H, Low Profits = L, Cheat Profits = C -Discount = r -Grim Strategy  If both choose this strategy, is it an equilibrium? Will parties want to cheat? -Profits from Both Pricing High = H/(1+r) + H/(1+r) 2 + H/(1+r) 3 + … = H/r -Profits for a Cheater = C/(1+r) + L/(1+r) 2 + L/(1+r) 3 +… = (C + L/r)/(1+r) -If H/r > (C + L/r)/(1+r), then both parties pricing high using the Grim Strategy is an equilibrium. Otherwise, parties have incentive to cheat, and pricing high will not be sustainable. -t-period Trigger Strategy  If the Grim strategy won’t work, this won’t work. If the Grim strategy does work, how many periods will you need to punish your opponent to get them to price high/not cheat? -Profits from Both Pricing High = H/(1+r) + H/(1+r) 2 + … + H/(1+r) t+1 -Profits for a Cheater = C/(1+r) + L/(1+r) 2 + L/(1+r) 3 +… + L/(1+r) t+1 -If the profits from both pricing high for the first t+1 periods are better than the cheating profits for the same periods, then the t-period trigger strategy is an equilibrium. Otherwise, parties have an incentive to cheat, and this strategy will not be sustainable.

Class Concepts – Repeated Games  Knowledge Check -Two firms can receive $8M in profits each if they both price high. If one of them decides to price lower, that firm will receive $15M in profits that period and the other firm will receive $0 in profits. If both firms price low they will receive $4M in profits each. Use a 10% discount rate. -1) Is the grim strategy effective?

Class Concepts – Repeated Games  Knowledge Check -Two firms can receive $8M in profits each if they both price high. If one of them decides to price lower, that firm will receive $15M in profits that period and the other firm will receive $0 in profits. If both firms price low they will receive $4M in profits each. Use a 10% discount rate. -1) Is the grim strategy effective? -Profits from Pricing High = $8M/0.1 = $80M -Profits from Cheating = $15M/1.1 + ($4M/1.1 + $4M/ …)/1.1 -Profits from Cheating = ($15M + $4M/.1)/1.1 = $50M -Yes, the grim strategy for both parties is an equilibrium. -2) Is the t-period trigger strategy effective for t = 2? For t = 3?

Class Concepts – Repeated Games  Knowledge Check -Two firms can receive $8M in profits each if they both price high. If one of them decides to price lower, that firm will receive $15M in profits that period and the other firm will receive $0 in profits. If both firms price low they will receive $4M in profits each. Use a 10% discount rate. -2) Is the t-period trigger strategy effective for t = 2? For t = 3? -For t = 2  No, the t-period trigger strategy is not an equilibrium for the game -Profits from Pricing High = $8/1.1 + $8/ $8/1.1 3 = $19.89M -Profits from Cheating = $15/1.1 + $4/ $4/1.1 3 = $19.94M -For t = 3  Yes, the t-period trigger strategy is an equilibrium -Profits from Pricing High = $8/1.1 + $8/ $8/ $8/1.1 4 = $25.36M -Profits from Cheating = $15/1.1 + $4/ $4/ $4/1.1 4 = $22.68M -So, you should price low for at least 3 periods to “punish” your opponent for cheating to make price moderation behavior the dominant strategy.

Class Concepts – Bertrand Trap & Anti-Trust  How to escape the Bertrand Trap -Product Differentiation -Consumer Switching Costs -Consumer Search Costs -Long-run price moderation & punishment -These are the strategies we just discussed, known as tacit collusion) -Limiting capacity -This shows a commitment to higher prices, and is another type of tacit collusion -Rebates (from toy car game)  Anti-Trust -Price Fixing is illegal! -“Efforts” to facilitate price moderation are illegal

Class Concepts – Principal-Agent Problems  Safelite Auto -Principal may be Safelite management -Agent is a Safelite employee -How can you align the incentives of the agent with those of the principal?  Economics of Networks -Positive Network Externality: The value of a network to an individual increases as more people join the network. -Establishing a new network is difficult as it is difficult to reach critical mass/tipping point -Target early adopters, large users and be prepared to subsidize those who switch or build complements for your network -Establish control over access to the network -If it is difficult or costly for users of the network to participate in multiple networks, these can be winner-take-all markets