Exercises on Auctions

Size: px
Start display at page:

Download "Exercises on Auctions"

Transcription

1 Exercises on Auctions 1) Consider sealed bid first price private value auctions where there are two bidders. Each player knows his own valuation and knows possible valuations of the other player and their respective probabilities. Namely the valuations of the two players, t1 and t2 are independent random variables, uniformly distributed between 0 and 100. What are the equilibrium bidding functions a * 1 (t 1 ) =? sealed bid private value auction? a 2 * (t 2 ) =? for the first price 2) Assume you are one of the two bidders in a private value first price auction where a grilled cheese sandwich, which purportedly bore a portrait 1 of the Virgin Mary, is being auctioned. The item is worth $10,000 to you. There is only one other rival bidder at the auction. You know that his valuation is uniformly distributed between 0 and $40,000. Assume that your rival is going to use his equilibrium bidding strategy. a) 1 The grilled cheese sandwich, which purportedly bore a portrait of the Virgin Mary. was sold for $28,000 in The winner of the auction was an online casino GoldenPalace.com. The Florida woman who had made it 10 years earlier said it never went moldy.

2 b) Assume that you learned that the grilled cheese sandwich is worth $14,000 to the second buyer. The second buyer won t be aware that you have this info and therefore would stick to his Bayes-Nash equilibrium strategy. c) Assume that you learned that the grilled cheese sandwich is worth $22,000 to the second buyer. The second buyer won t be aware that you have this info and therefore would stick to his Bayes-Nash equilibrium strategy. d) Assume the auction rules have changed. The highest bid still wins, but the winner has to pay only 75% of his bid. (Your rival is not mathematically sophisticated and would stick to his Bayes-Nash equilibrium strategy) The item is worth $10,000 to you. You know that your rival s valuation is uniformly distributed between 0 and $40,000.

3 3) Assume you are considering auctioning your beloved 2009 Honda Civic, as you near graduation. There are two potential bidders. One of them is a close friend and you know that he values your car at $2,000, the second bidder s valuation is uncertain with a uniform distribution between 0 and $5,000. The two bidders don t know each other s valuation exactly and they each guess that it is a random value with uniform distribution between 0 and $5,000 and they will use Bayes-Nash Equilibrium strategies in this auction. a) Calculate your expected revenue if you use a first-price auction to sell your car. b) Calculate your expected revenue if you use a second-price auction to sell your car. c) Which auction rule would you prefer, first price or second price?

4 4) a) What are the equilibrium bidding functions a 1 * (t 1 ) =? a 2 * (t 2 ) =? for a sealed bid private value second price auction? b) Assume you are one of the two bidders in a second price private value auction where the foam latex Spock ears 2 worn by Leonard Nimoy in Star Trek V is being auctioned. Suppose the Spock ears worth $8,000 to you. There is only one other rival bidder at the auction. You know that his valuation is uniformly distributed between 0 and $12, The foam latex ears with remnants of adhesive on the back were sold for $10,000. Leonard Nimoy wore the ears in Star Trek V which is considered by many one of the worse Star Trek movies ever.

5 5) Suppose you are the owner of a pristine copy of Action Comic No.1, the first comic book to feature Superman3. You would like to sell this item in a closed bid auction. There are two bidders who are interested in this comic book. a) Assume the bidders don t know each other s valuation exactly and they each guess that it is a random value with uniform distribution between 0 and $5 million. As a seller would you prefer a first price or second price auction? (You don t know the buyer valuations, but you know that they are uniformly distributed between 0 and 5 million) Explain. b) Now assume that you learned that the copy of Action Comic No.1 is worth $4 million to the first buyer and 3 million to the second buyer. The two players won t be aware that you have this info and they would stick to their Bayes-Nash equilibrium strategies. Calculate your expected revenue for a first price auction. Calculate your expected revenue for a second price auction. A pristine copy of Action Comic No.1, the first comic book to feature Superman, became the most expensive comic book when it sold for $3.2 million in

6 6) Consider sealed bid first price common value auctions where there are two bidders. The item has a common value, which is partly observed by the bidders. Each player knows his own observation and knows possible observations of the other player and their respective probabilities. Namely the observation of the two players, t1 and t2 are independent random variables, uniformly distributed between 0 and 100. The common value of the item is given by Common value = player 1 s observation + player 2 s observation. i.e. v = t1 + t2 What are the equilibrium bidding functions a * 1 (t 1 ) =? game? a 2 * (t 2 ) =? of this auction 7) FCC is selling rights to the new 10GHz band for long-range microwave communication using a common value auction. The common value of the item is equal to v = t1 + t2, where t1 and t2 are the observations of each bidder. The buyers don t know each other s observation and believe that it is distributed uniformly between 0 and 100. a) Assume you are a consultant to FCC. You learned that the observation of the first buyer is t1=40 and the observation of the second buyer is t2=60. Consider a first price common value auction. Calculate Government s revenue and the bids of each player in the following two cases. i) You secretly tell the first buyer, the observation of the second buyer. (second buyer is unaware of this and will stick to his Bayes-Nash equilibrium strategy) ii) You secretly tell the second buyer, the observation of the first buyer. (first buyer is unaware of this and will stick to his Bayes-Nash equilibrium strategy) i) Buyer 1 bids: Buyer 2 bids: Revenue from the auction: ii) Buyer 1 bids: Buyer 2 bids: Revenue from the auction:

7 b) Consider a first price common value auction again.the buyers don t know each other s observation and believe that it is distributed uniformly between 0 and 100. Assume the observation of the first buyer is t 1 = 40. What would be his optimal bid and his corresponding expected payoff?

Exercises on Auctions. What are the equilibrium bidding functions a * 1 ) = ) = t 2 2. ) = t 1 2, a 2(t 2

Exercises on Auctions. What are the equilibrium bidding functions a * 1 ) = ) = t 2 2. ) = t 1 2, a 2(t 2 Exercises on Auctions 1) Consider sealed bid first price private value auctions where there are two bidders. Each player knows his own valuation and knows possible valuations of the other player and their

More information

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy.

Notes on Auctions. Theorem 1 In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Notes on Auctions Second Price Sealed Bid Auctions These are the easiest auctions to analyze. Theorem In a second price sealed bid auction bidding your valuation is always a weakly dominant strategy. Proof

More information

Auction Theory: Some Basics

Auction Theory: Some Basics Auction Theory: Some Basics Arunava Sen Indian Statistical Institute, New Delhi ICRIER Conference on Telecom, March 7, 2014 Outline Outline Single Good Problem Outline Single Good Problem First Price Auction

More information

Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms

Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms Topics in Informational Economics 2 Games with Private Information and Selling Mechanisms Watson 26-27, pages 312-333 Bruno Salcedo The Pennsylvania State University Econ 402 Summer 2012 Private Information

More information

Auction is a commonly used way of allocating indivisible

Auction is a commonly used way of allocating indivisible Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 16. BIDDING STRATEGY AND AUCTION DESIGN Auction is a commonly used way of allocating indivisible goods among interested buyers. Used cameras, Salvator Mundi, and

More information

Bayesian Nash Equilibrium

Bayesian Nash Equilibrium Bayesian Nash Equilibrium We have already seen that a strategy for a player in a game of incomplete information is a function that specifies what action or actions to take in the game, for every possibletypeofthatplayer.

More information

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1

Recap First-Price Revenue Equivalence Optimal Auctions. Auction Theory II. Lecture 19. Auction Theory II Lecture 19, Slide 1 Auction Theory II Lecture 19 Auction Theory II Lecture 19, Slide 1 Lecture Overview 1 Recap 2 First-Price Auctions 3 Revenue Equivalence 4 Optimal Auctions Auction Theory II Lecture 19, Slide 2 Motivation

More information

Strategy -1- Strategic equilibrium in auctions

Strategy -1- Strategic equilibrium in auctions Strategy -- Strategic equilibrium in auctions A. Sealed high-bid auction 2 B. Sealed high-bid auction: a general approach 6 C. Other auctions: revenue equivalence theorem 27 D. Reserve price in the sealed

More information

CUR 412: Game Theory and its Applications, Lecture 4

CUR 412: Game Theory and its Applications, Lecture 4 CUR 412: Game Theory and its Applications, Lecture 4 Prof. Ronaldo CARPIO March 27, 2015 Homework #1 Homework #1 will be due at the end of class today. Please check the website later today for the solutions

More information

Notes for Section: Week 7

Notes for Section: Week 7 Economics 160 Professor Steven Tadelis Stanford University Spring Quarter, 004 Notes for Section: Week 7 Notes prepared by Paul Riskind (pnr@stanford.edu). spot errors or have questions about these notes.

More information

Problem Set 3: Suggested Solutions

Problem Set 3: Suggested Solutions Microeconomics: Pricing 3E00 Fall 06. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must

More information

Strategy -1- Strategy

Strategy -1- Strategy Strategy -- Strategy A Duopoly, Cournot equilibrium 2 B Mixed strategies: Rock, Scissors, Paper, Nash equilibrium 5 C Games with private information 8 D Additional exercises 24 25 pages Strategy -2- A

More information

ECON Microeconomics II IRYNA DUDNYK. Auctions.

ECON Microeconomics II IRYNA DUDNYK. Auctions. Auctions. What is an auction? When and whhy do we need auctions? Auction is a mechanism of allocating a particular object at a certain price. Allocating part concerns who will get the object and the price

More information

CUR 412: Game Theory and its Applications, Lecture 4

CUR 412: Game Theory and its Applications, Lecture 4 CUR 412: Game Theory and its Applications, Lecture 4 Prof. Ronaldo CARPIO March 22, 2015 Homework #1 Homework #1 will be due at the end of class today. Please check the website later today for the solutions

More information

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017

ECON 459 Game Theory. Lecture Notes Auctions. Luca Anderlini Spring 2017 ECON 459 Game Theory Lecture Notes Auctions Luca Anderlini Spring 2017 These notes have been used and commented on before. If you can still spot any errors or have any suggestions for improvement, please

More information

Sequential-move games with Nature s moves.

Sequential-move games with Nature s moves. Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 3. GAMES WITH SEQUENTIAL MOVES Game trees. Sequential-move games with finite number of decision notes. Sequential-move games with Nature s moves. 1 Strategies in

More information

Consider the following (true) preference orderings of 4 agents on 4 candidates.

Consider the following (true) preference orderings of 4 agents on 4 candidates. Part 1: Voting Systems Consider the following (true) preference orderings of 4 agents on 4 candidates. Agent #1: A > B > C > D Agent #2: B > C > D > A Agent #3: C > B > D > A Agent #4: D > C > A > B Assume

More information

ECO 426 (Market Design) - Lecture 9

ECO 426 (Market Design) - Lecture 9 ECO 426 (Market Design) - Lecture 9 Ettore Damiano November 30, 2015 Common Value Auction In a private value auction: the valuation of bidder i, v i, is independent of the other bidders value In a common

More information

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction

Today. Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction Today Applications of NE and SPNE Auctions English Auction Second-Price Sealed-Bid Auction First-Price Sealed-Bid Auction 2 / 26 Auctions Used to allocate: Art Government bonds Radio spectrum Forms: Sequential

More information

HW Consider the following game:

HW Consider the following game: HW 1 1. Consider the following game: 2. HW 2 Suppose a parent and child play the following game, first analyzed by Becker (1974). First child takes the action, A 0, that produces income for the child,

More information

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto

Auctions. Episode 8. Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Auctions Episode 8 Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Paying Per Click 3 Paying Per Click Ads in Google s sponsored links are based on a cost-per-click

More information

Lecture 6 Applications of Static Games of Incomplete Information

Lecture 6 Applications of Static Games of Incomplete Information Lecture 6 Applications of Static Games of Incomplete Information Good to be sold at an auction. Which auction design should be used in order to maximize expected revenue for the seller, if the bidders

More information

Bayesian games and their use in auctions. Vincent Conitzer

Bayesian games and their use in auctions. Vincent Conitzer Bayesian games and their use in auctions Vincent Conitzer conitzer@cs.duke.edu What is mechanism design? In mechanism design, we get to design the game (or mechanism) e.g. the rules of the auction, marketplace,

More information

Auction types. All Pay Auction: Everyone writes down a bid in secret. The person with the highest bid wins. Everyone pays.

Auction types. All Pay Auction: Everyone writes down a bid in secret. The person with the highest bid wins. Everyone pays. Auctions An auction is a mechanism for trading items by means of bidding. Dates back to 500 BC where Babylonians auctioned off women as wives. Position of Emperor of Rome was auctioned off in 193 ad Can

More information

Social Network Analysis

Social Network Analysis Lecture IV Auctions Kyumars Sheykh Esmaili Where Are Auctions Appropriate? Where sellers do not have a good estimate of the buyers true values for an item, and where buyers do not know each other s values

More information

Auctions. Book Pages Auction. Auction types. Rules to Auctions

Auctions. Book Pages Auction. Auction types. Rules to Auctions Auctions An auction is a mechanism for trading items by means of bidding. Dates back to BC where Babylonians auctioned of women as wives. Position of Emperor of Rome was auctioned off in ad Can have the

More information

CSV 886 Social Economic and Information Networks. Lecture 4: Auctions, Matching Markets. R Ravi

CSV 886 Social Economic and Information Networks. Lecture 4: Auctions, Matching Markets. R Ravi CSV 886 Social Economic and Information Networks Lecture 4: Auctions, Matching Markets R Ravi ravi+iitd@andrew.cmu.edu Schedule 2 Auctions 3 Simple Models of Trade Decentralized Buyers and sellers have

More information

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints.

1 Auctions. 1.1 Notation (Symmetric IPV) Independent private values setting with symmetric riskneutral buyers, no budget constraints. 1 Auctions 1.1 Notation (Symmetric IPV) Ancient market mechanisms. use. A lot of varieties. Widespread in Independent private values setting with symmetric riskneutral buyers, no budget constraints. Simple

More information

ECO 426 (Market Design) - Lecture 11

ECO 426 (Market Design) - Lecture 11 ECO 426 (Market Design) - Lecture 11 Ettore Damiano December 7, 2015 Sponsored search auctions Google, Yahoo etc.. sell ad spaces linked to keyword searches Google advertising revenue: USD 42.5bn in 2012

More information

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information

Games of Incomplete Information ( 資訊不全賽局 ) Games of Incomplete Information 1 Games of Incomplete Information ( 資訊不全賽局 ) Wang 2012/12/13 (Lecture 9, Micro Theory I) Simultaneous Move Games An Example One or more players know preferences only probabilistically (cf. Harsanyi, 1976-77)

More information

Game Theory Lecture #16

Game Theory Lecture #16 Game Theory Lecture #16 Outline: Auctions Mechanism Design Vickrey-Clarke-Groves Mechanism Optimizing Social Welfare Goal: Entice players to select outcome which optimizes social welfare Examples: Traffic

More information

Revenue Equivalence and Mechanism Design

Revenue Equivalence and Mechanism Design Equivalence and Design Daniel R. 1 1 Department of Economics University of Maryland, College Park. September 2017 / Econ415 IPV, Total Surplus Background the mechanism designer The fact that there are

More information

Mechanism Design and Auctions

Mechanism Design and Auctions Multiagent Systems (BE4M36MAS) Mechanism Design and Auctions Branislav Bošanský and Michal Pěchouček Artificial Intelligence Center, Department of Computer Science, Faculty of Electrical Engineering, Czech

More information

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer Review, oligopoly, auctions, and signaling. Block 3 Jul 1, 2018

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer Review, oligopoly, auctions, and signaling. Block 3 Jul 1, 2018 UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2018 Review, oligopoly, auctions, and signaling Block 3 Jul 1, 2018 Game plan Life must be lived forwards, but it can only

More information

Name. FINAL EXAM, Econ 171, March, 2015

Name. FINAL EXAM, Econ 171, March, 2015 Name FINAL EXAM, Econ 171, March, 2015 There are 9 questions. Answer any 8 of them. Good luck! Remember, you only need to answer 8 questions Problem 1. (True or False) If a player has a dominant strategy

More information

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University

Auctions. Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University Auctions Michal Jakob Agent Technology Center, Dept. of Computer Science and Engineering, FEE, Czech Technical University AE4M36MAS Autumn 2015 - Lecture 12 Where are We? Agent architectures (inc. BDI

More information

SI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z

SI 563 Homework 3 Oct 5, Determine the set of rationalizable strategies for each of the following games. a) X Y X Y Z SI 563 Homework 3 Oct 5, 06 Chapter 7 Exercise : ( points) Determine the set of rationalizable strategies for each of the following games. a) U (0,4) (4,0) M (3,3) (3,3) D (4,0) (0,4) X Y U (0,4) (4,0)

More information

Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017

Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 2017 Microeconomic Theory II Preliminary Examination Solutions Exam date: June 5, 07. (40 points) Consider a Cournot duopoly. The market price is given by q q, where q and q are the quantities of output produced

More information

Networks: Fall 2010 Homework 3 David Easley and Jon Kleinberg Due in Class September 29, 2010

Networks: Fall 2010 Homework 3 David Easley and Jon Kleinberg Due in Class September 29, 2010 Networks: Fall 00 Homework David Easley and Jon Kleinberg Due in Class September 9, 00 As noted on the course home page, homework solutions must be submitted by upload to the CMS site, at https://cms.csuglab.cornell.edu/.

More information

Game Theory Problem Set 4 Solutions

Game Theory Problem Set 4 Solutions Game Theory Problem Set 4 Solutions 1. Assuming that in the case of a tie, the object goes to person 1, the best response correspondences for a two person first price auction are: { }, < v1 undefined,

More information

9.2 Adverse Selection under Certainty: Lemons I and II. The principal contracts to buy from the agent a car whose quality

9.2 Adverse Selection under Certainty: Lemons I and II. The principal contracts to buy from the agent a car whose quality 9.2 Adverse Selection under Certainty: Lemons I and II The principal contracts to buy from the agent a car whose quality is noncontractible despite the lack of uncertainty. The Basic Lemons Model ð Players

More information

COS 445 Final. Due online Monday, May 21st at 11:59 pm. Please upload each problem as a separate file via MTA.

COS 445 Final. Due online Monday, May 21st at 11:59 pm. Please upload each problem as a separate file via MTA. COS 445 Final Due online Monday, May 21st at 11:59 pm All problems on this final are no collaboration problems. You may not discuss any aspect of any problems with anyone except for the course staff. You

More information

Games with Private Information 資訊不透明賽局

Games with Private Information 資訊不透明賽局 Games with Private Information 資訊不透明賽局 Joseph Tao-yi Wang 00/0/5 (Lecture 9, Micro Theory I-) Market Entry Game with Private Information (-,4) (-,) BE when p < /: (,, ) (-,4) (-,) BE when p < /: (,, )

More information

1 Theory of Auctions. 1.1 Independent Private Value Auctions

1 Theory of Auctions. 1.1 Independent Private Value Auctions 1 Theory of Auctions 1.1 Independent Private Value Auctions for the moment consider an environment in which there is a single seller who wants to sell one indivisible unit of output to one of n buyers

More information

These are our goals for fairness. A fair division procedure is if each player believes he or she received the same fractional part of the total value.

These are our goals for fairness. A fair division procedure is if each player believes he or she received the same fractional part of the total value. ( c ) E p s t e i n, C a r t e r, a n d B o l l i n g e r 2 0 1 6 C h a p t e r 13: F a i r D i v i s i o n P a g e 1 CHAPTER 13: Fair Division When items need to be divided (divorce, roommates moving

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India July 2012 The Revenue Equivalence Theorem Note: This is a only a draft

More information

Game Theory and Auctions

Game Theory and Auctions Game Theory and Auctions Dr Christoph Stork What is Game Theory? Mathematically capture behaviour in strategic situations (games) in which an individual's success in making choices depends on the choices

More information

Auctions: Types and Equilibriums

Auctions: Types and Equilibriums Auctions: Types and Equilibriums Emrah Cem and Samira Farhin University of Texas at Dallas emrah.cem@utdallas.edu samira.farhin@utdallas.edu April 25, 2013 Emrah Cem and Samira Farhin (UTD) Auctions April

More information

The Cascade Auction A Mechanism For Deterring Collusion In Auctions

The Cascade Auction A Mechanism For Deterring Collusion In Auctions The Cascade Auction A Mechanism For Deterring Collusion In Auctions Uriel Feige Weizmann Institute Gil Kalai Hebrew University and Microsoft Research Moshe Tennenholtz Technion and Microsoft Research Abstract

More information

CS 573: Algorithmic Game Theory Lecture date: March 26th, 2008

CS 573: Algorithmic Game Theory Lecture date: March 26th, 2008 CS 573: Algorithmic Game Theory Lecture date: March 26th, 28 Instructor: Chandra Chekuri Scribe: Qi Li Contents Overview: Auctions in the Bayesian setting 1 1 Single item auction 1 1.1 Setting............................................

More information

The Optimality of Being Efficient. Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland

The Optimality of Being Efficient. Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland The Optimality of Being Efficient Lawrence Ausubel and Peter Cramton Department of Economics University of Maryland 1 Common Reaction Why worry about efficiency, when there is resale? Our Conclusion Why

More information

Lecture #6: Auctions: Theory and Applications. Prof. Dr. Sven Seuken

Lecture #6: Auctions: Theory and Applications. Prof. Dr. Sven Seuken Lecture #6: Auctions: Theory and Applications Prof. Dr. Sven Seuken 15.3.2012 Housekeeping Questions? Concerns? BitTorrent homework assignment? Posting on NB: do not copy/paste from PDFs Game Theory Homework:

More information

Chapter 11: Network Models of Markets with Intermediaries. Presented by Vladislava Arabadzhieva

Chapter 11: Network Models of Markets with Intermediaries. Presented by Vladislava Arabadzhieva Chapter 11: Network Models of Markets with Intermediaries Presented by Vladislava Arabadzhieva 1 Contents 11.1 Price-Setting in Markets 11.2 A Model of Trade on Networks 11.3 Equilibria in Trading Networks

More information

Spring 2017 Final Exam

Spring 2017 Final Exam Spring 07 Final Exam ECONS : Strategy and Game Theory Tuesday May, :0 PM - 5:0 PM irections : Complete 5 of the 6 questions on the exam. You will have a minimum of hours to complete this final exam. No

More information

2 Comparison Between Truthful and Nash Auction Games

2 Comparison Between Truthful and Nash Auction Games CS 684 Algorithmic Game Theory December 5, 2005 Instructor: Éva Tardos Scribe: Sameer Pai 1 Current Class Events Problem Set 3 solutions are available on CMS as of today. The class is almost completely

More information

by open ascending bid ("English") auction Auctioneer raises asking price until all but one bidder drops out

by open ascending bid (English) auction Auctioneer raises asking price until all but one bidder drops out Auctions. Auction off a single item (a) () (c) (d) y open ascending id ("English") auction Auctioneer raises asking price until all ut one idder drops out y Dutch auction (descending asking price) Auctioneer

More information

CUR 412: Game Theory and its Applications, Lecture 12

CUR 412: Game Theory and its Applications, Lecture 12 CUR 412: Game Theory and its Applications, Lecture 12 Prof. Ronaldo CARPIO May 24, 2016 Announcements Homework #4 is due next week. Review of Last Lecture In extensive games with imperfect information,

More information

Auctions. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. November 17, 2016

Auctions. Economics Auction Theory. Instructor: Songzi Du. Simon Fraser University. November 17, 2016 Auctions Economics 383 - Auction Theory Instructor: Songzi Du Simon Fraser University November 17, 2016 ECON 383 (SFU) Auctions November 17, 2016 1 / 28 Auctions Mechanisms of transaction: bargaining,

More information

Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing.

Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium. in pure strategies through intentional mixing. Econ 221 Fall, 2018 Li, Hao UBC CHAPTER 7. SIMULTANEOUS-MOVE GAMES: MIXED STRATEGIES Now we return to simultaneous-move games. We resolve the issue of non-existence of Nash equilibrium in pure strategies

More information

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding

Multiunit Auctions: Package Bidding October 24, Multiunit Auctions: Package Bidding Multiunit Auctions: Package Bidding 1 Examples of Multiunit Auctions Spectrum Licenses Bus Routes in London IBM procurements Treasury Bills Note: Heterogenous vs Homogenous Goods 2 Challenges in Multiunit

More information

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions?

March 30, Why do economists (and increasingly, engineers and computer scientists) study auctions? March 3, 215 Steven A. Matthews, A Technical Primer on Auction Theory I: Independent Private Values, Northwestern University CMSEMS Discussion Paper No. 196, May, 1995. This paper is posted on the course

More information

Markets with Intermediaries

Markets with Intermediaries Markets with Intermediaries Episode Baochun Li Professor Department of Electrical and Computer Engineering University of Toronto Network Models of Markets with Intermediaries (Chapter ) Who sets the prices?

More information

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9

Auctions. Agenda. Definition. Syllabus: Mansfield, chapter 15 Jehle, chapter 9 Auctions Syllabus: Mansfield, chapter 15 Jehle, chapter 9 1 Agenda Types of auctions Bidding behavior Buyer s maximization problem Seller s maximization problem Introducing risk aversion Winner s curse

More information

Markets with Intermediaries

Markets with Intermediaries Markets with Intermediaries Part III: Dynamics Episode Baochun Li Department of Electrical and Computer Engineering University of Toronto Required reading: Networks, Crowds, and Markets, Chapter..5 Who

More information

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham

Optimal Auctions. Game Theory Course: Jackson, Leyton-Brown & Shoham Game Theory Course: Jackson, Leyton-Brown & Shoham So far we have considered efficient auctions What about maximizing the seller s revenue? she may be willing to risk failing to sell the good she may be

More information

Econ 210, Final, Fall 2015.

Econ 210, Final, Fall 2015. Econ 210, Final, Fall 2015. Prof. Guse, W & L University Instructions. You have 3 hours to complete the exam. You will answer questions worth a total of 90 points. Please write all of your responses on

More information

Introduction to Multi-Agent Programming

Introduction to Multi-Agent Programming Introduction to Multi-Agent Programming 10. Game Theory Strategic Reasoning and Acting Alexander Kleiner and Bernhard Nebel Strategic Game A strategic game G consists of a finite set N (the set of players)

More information

University of Hong Kong

University of Hong Kong University of Hong Kong ECON6036 Game Theory and Applications Problem Set I 1 Nash equilibrium, pure and mixed equilibrium 1. This exercise asks you to work through the characterization of all the Nash

More information

Final Exam (100 Points Total)

Final Exam (100 Points Total) Final Exam (100 Points Total) The space provided below each question should be sufficient for your answer. If you need additional space, use additional paper. You are allowed to use a calculator, but only

More information

Auctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills.

Auctions. Microeconomics II. Auction Formats. Auction Formats. Many economic transactions are conducted through auctions treasury bills. Auctions Microeconomics II Auctions Levent Koçkesen Koç University Many economic transactions are conducted through auctions treasury bills art work foreign exchange antiques publicly owned companies cars

More information

Introduction to Political Economy Problem Set 3

Introduction to Political Economy Problem Set 3 Introduction to Political Economy 14.770 Problem Set 3 Due date: Question 1: Consider an alternative model of lobbying (compared to the Grossman and Helpman model with enforceable contracts), where lobbies

More information

Insurance, Adverse Selection and Moral Hazard

Insurance, Adverse Selection and Moral Hazard University of California, Berkeley Spring 2007 ECON 100A Section 115, 116 Insurance, Adverse Selection and Moral Hazard I. Risk Premium Risk Premium is the amount of money an individual is willing to pay

More information

CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma

CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma CS 331: Artificial Intelligence Game Theory I 1 Prisoner s Dilemma You and your partner have both been caught red handed near the scene of a burglary. Both of you have been brought to the police station,

More information

Tips for Managing and Approving Bidders

Tips for Managing and Approving Bidders Tips for Managing and Approving Bidders Now that your sale is online, bidders will begin to preview the catalog, register for the sale, and leave absentee bids. It is your job to review the registrations

More information

Simon Fraser University Spring 2014

Simon Fraser University Spring 2014 Simon Fraser University Spring 2014 Econ 302 D200 Final Exam Solution This brief solution guide does not have the explanations necessary for full marks. NE = Nash equilibrium, SPE = subgame perfect equilibrium,

More information

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats

Subjects: What is an auction? Auction formats. True values & known values. Relationships between auction formats Auctions Subjects: What is an auction? Auction formats True values & known values Relationships between auction formats Auctions as a game and strategies to win. All-pay auctions What is an auction? An

More information

Problem Set 3: Suggested Solutions

Problem Set 3: Suggested Solutions Microeconomics: Pricing 3E Fall 5. True or false: Problem Set 3: Suggested Solutions (a) Since a durable goods monopolist prices at the monopoly price in her last period of operation, the prices must be

More information

Matching Markets and Google s Sponsored Search

Matching Markets and Google s Sponsored Search Matching Markets and Google s Sponsored Search Part III: Dynamics Episode 9 Baochun Li Department of Electrical and Computer Engineering University of Toronto Matching Markets (Required reading: Chapter

More information

Practice Problems. U(w, e) = p w e 2,

Practice Problems. U(w, e) = p w e 2, Practice Problems Information Economics (Ec 515) George Georgiadis Problem 1. Static Moral Hazard Consider an agency relationship in which the principal contracts with the agent. The monetary result of

More information

Chapter 17 Auctions and Bargaining. Outline. Auctions

Chapter 17 Auctions and Bargaining. Outline. Auctions Part IV: Extending the Microeconomic Toolbox 15. Trade-offs Involving Time and Risk 16. The Economics of Information 17. 18. Social Economics 1 / 39 Chapter 17 2018.3.2. 2 / 39 1 2 3 / 39 Q: How should

More information

Economics Honors Exam 2009 Solutions: Microeconomics, Questions 1-2

Economics Honors Exam 2009 Solutions: Microeconomics, Questions 1-2 Economics Honors Exam 2009 Solutions: Microeconomics, Questions 1-2 Question 1 (Microeconomics, 30 points). A ticket to a newly staged opera is on sale through sealed-bid auction. There are three bidders,

More information

Microeconomics Comprehensive Exam

Microeconomics Comprehensive Exam Microeconomics Comprehensive Exam June 2009 Instructions: (1) Please answer each of the four questions on separate pieces of paper. (2) When finished, please arrange your answers alphabetically (in the

More information

CMSC 474, Introduction to Game Theory Introduction to Auctions

CMSC 474, Introduction to Game Theory Introduction to Auctions CMSC 474, Introduction to Game Theory Introduction to Auctions Mohammad T. Hajiaghayi University of Maryland Auctions An auction is a way (other than bargaining) to sell a fixed supply of a commodity (an

More information

Game Theory. Jiang, Bo ( 江波 )

Game Theory. Jiang, Bo ( 江波 ) Game Theory Jiang, Bo ( 江波 ) jiang.bo@mail.shufe.edu.cn Majority voting Mechanism Design Three candidates: x, y, z. Three voters: a, b, c. Voter a: x>y>z; voter b: y>z>x; voter c: z>x>y What is the final

More information

Prisoner s Dilemma. CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma. Prisoner s Dilemma. Prisoner s Dilemma.

Prisoner s Dilemma. CS 331: Artificial Intelligence Game Theory I. Prisoner s Dilemma. Prisoner s Dilemma. Prisoner s Dilemma. CS 331: rtificial Intelligence Game Theory I You and your partner have both been caught red handed near the scene of a burglary. oth of you have been brought to the police station, where you are interrogated

More information

Efficient provision of a public good

Efficient provision of a public good Public Goods Once a pure public good is provided, the additional resource cost of another person consuming the good is zero. The public good is nonrival in consumption. Examples: lighthouse national defense

More information

Experiments on Auctions

Experiments on Auctions Experiments on Auctions Syngjoo Choi Spring, 2010 Experimental Economics (ECON3020) Auction Spring, 2010 1 / 25 Auctions An auction is a process of buying and selling commodities by taking bids and assigning

More information

In the Name of God. Sharif University of Technology. Graduate School of Management and Economics

In the Name of God. Sharif University of Technology. Graduate School of Management and Economics In the Name of God Sharif University of Technology Graduate School of Management and Economics Microeconomics (for MBA students) 44111 (1393-94 1 st term) - Group 2 Dr. S. Farshad Fatemi Game Theory Game:

More information

All Equilibrium Revenues in Buy Price Auctions

All Equilibrium Revenues in Buy Price Auctions All Equilibrium Revenues in Buy Price Auctions Yusuke Inami Graduate School of Economics, Kyoto University This version: January 009 Abstract This note considers second-price, sealed-bid auctions with

More information

Games of Incomplete Information

Games of Incomplete Information Games of Incomplete Information EC202 Lectures V & VI Francesco Nava London School of Economics January 2011 Nava (LSE) EC202 Lectures V & VI Jan 2011 1 / 22 Summary Games of Incomplete Information: Definitions:

More information

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1

M.Phil. Game theory: Problem set II. These problems are designed for discussions in the classes of Week 8 of Michaelmas term. 1 M.Phil. Game theory: Problem set II These problems are designed for discussions in the classes of Week 8 of Michaelmas term.. Private Provision of Public Good. Consider the following public good game:

More information

Auctions and Common Property

Auctions and Common Property Sloan School of Management 15.010/15.011 Massachusetts Institute of Technology RECITATION NOTES #9 Auctions and Common Property Friday - November 19, 2004 OUTLINE OF TODAY S RECITATION 1. Auctions: types

More information

Game Theory: Additional Exercises

Game Theory: Additional Exercises Game Theory: Additional Exercises Problem 1. Consider the following scenario. Players 1 and 2 compete in an auction for a valuable object, for example a painting. Each player writes a bid in a sealed envelope,

More information

ECON20710 Lecture Auction as a Bayesian Game

ECON20710 Lecture Auction as a Bayesian Game ECON7 Lecture Auction as a Bayesian Game Hanzhe Zhang Tuesday, November 3, Introduction Auction theory has been a particularly successful application of game theory ideas to the real world, with its uses

More information

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010 Answer Key Problem Set 1 Francesco Nava Microeconomic Principles II EC202 Lent Term 2010 Please give your answers to your class teacher by Friday of week 6 LT. If you not to hand in at your class, make

More information

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016

UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 UC Berkeley Haas School of Business Game Theory (EMBA 296 & EWMBA 211) Summer 2016 More on strategic games and extensive games with perfect information Block 2 Jun 11, 2017 Auctions results Histogram of

More information

without transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality.

without transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality. 0 Auctions The Coase theorem without transaction costs, all government allocations are equally efficient, since parties will bargain to correct any externality. with transaction costs, government may minimize

More information

Auctioning one item. Tuomas Sandholm Computer Science Department Carnegie Mellon University

Auctioning one item. Tuomas Sandholm Computer Science Department Carnegie Mellon University Auctioning one item Tuomas Sandholm Computer Science Department Carnegie Mellon University Auctions Methods for allocating goods, tasks, resources... Participants: auctioneer, bidders Enforced agreement

More information

ISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London.

ISSN BWPEF Uninformative Equilibrium in Uniform Price Auctions. Arup Daripa Birkbeck, University of London. ISSN 1745-8587 Birkbeck Working Papers in Economics & Finance School of Economics, Mathematics and Statistics BWPEF 0701 Uninformative Equilibrium in Uniform Price Auctions Arup Daripa Birkbeck, University

More information

EconS Games with Incomplete Information II and Auction Theory

EconS Games with Incomplete Information II and Auction Theory EconS 424 - Games with Incomplete Information II and Auction Theory Félix Muñoz-García Washington State University fmunoz@wsu.edu April 28, 2014 Félix Muñoz-García (WSU) EconS 424 - Recitation 9 April

More information