Auctions and Common Property

Similar documents
Social Network Analysis

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

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

Lecture 6 Applications of Static Games of Incomplete Information

Auction is a commonly used way of allocating indivisible

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

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

Auctions. N i k o l a o s L i o n i s U n i v e r s i t y O f A t h e n s. ( R e v i s e d : J a n u a r y )

Experiments on Auctions

1 Theory of Auctions. 1.1 Independent Private Value Auctions

Bayesian games and their use in auctions. Vincent Conitzer

Bayesian Nash Equilibrium

Problem Set 3: Suggested Solutions

HW Consider the following game:

Econ 101A Final exam May 14, 2013.

ECON Microeconomics II IRYNA DUDNYK. Auctions.

CMSC 474, Introduction to Game Theory Introduction to Auctions

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

Auctions and Optimal Bidding

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

Game Theory and Auctions

October An Equilibrium of the First Price Sealed Bid Auction for an Arbitrary Distribution.

Auctions: Types and Equilibriums

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

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

Final Exam (100 Points Total)

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

Strategy -1- Strategy

EXAMPLE OF FAILURE OF EQUILIBRIUM Akerlof's market for lemons (P-R pp )

ECO 426 (Market Design) - Lecture 9

Topics in Contract Theory Lecture 6. Separation of Ownership and Control

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

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

Parkes Auction Theory 1. Auction Theory. Jacomo Corbo. School of Engineering and Applied Science, Harvard University

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

Auction Theory for Undergrads

Strategy -1- Strategic equilibrium in auctions

Games with Private Information 資訊不透明賽局

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

A Systematic Presentation of Equilibrium Bidding Strategies to Undergradudate Students

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

Econ 101A Final exam May 14, 2013.

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

Algorithmic Game Theory

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

ECO 426 (Market Design) - Lecture 8

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

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

Need for Treasury Market. No return from holding excess reserves for a bank. Treasury investments yield returns for the holding period.

Final Examination December 14, Economics 5010 AF3.0 : Applied Microeconomics. time=2.5 hours

CUR 412: Game Theory and its Applications, Lecture 4

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

Preference Networks in Matching Markets

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

1 Intro to game theory

Auctions. MSc Finance Theory of Finance 1: Financial Topics Autumn Arup Daripa Birkbeck College. The background

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

Economics 101A (Lecture 21) Stefano DellaVigna

Elements of Economic Analysis II Lecture XI: Oligopoly: Cournot and Bertrand Competition

Auction Theory - An Introduction

Agent and Object Technology Lab Dipartimento di Ingegneria dell Informazione Università degli Studi di Parma. Distributed and Agent Systems

Parkes Auction Theory 1. Auction Theory. David C. Parkes. Division of Engineering and Applied Science, Harvard University

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

Part 1 Examination Paper 1.2. Section A 10 C 11 C 2 A 13 C 1 B 15 C 6 C 17 B 18 C 9 D 20 C 21 C 22 D 23 D 24 C 25 C

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

Microeconomics I. Undergraduate Programs in Business Administration and Economics

Problem Set 3: Suggested Solutions

EconS Games with Incomplete Information II and Auction Theory

Sequential-move games with Nature s moves.

Chapter 3. Dynamic discrete games and auctions: an introduction

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

Francesco Nava Microeconomic Principles II EC202 Lent Term 2010

Costs and Profit Maximization Under Competition

1. The precise formula for the variance of a portfolio of two securities is: where

University of Hong Kong

Auction Theory: Some Basics

G5212: Game Theory. Mark Dean. Spring 2017

Game Theory: Additional Exercises

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

Economics 101A (Lecture 21) Stefano DellaVigna

EC 202. Lecture notes 14 Oligopoly I. George Symeonidis

Chapter 17 Auctions and Bargaining. Outline. Auctions

Auctioning a Single Item. Auctions. Simple Auctions. Simple Auctions. Models of Private Information. Models of Private Information

Solution to Assignment 3

LECTURE 7: SINGLE OBJECT AUCTIONS. 9/11/2010 EC3322 Autumn

Single-Parameter Mechanisms

Descending Price Optimally Coordinates Search. INFORMS, Nov 2018

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.

Notes on a Basic Business Problem MATH 104 and MATH 184 Mark Mac Lean (with assistance from Patrick Chan) 2011W

Exercises Solutions: Oligopoly

Recalling that private values are a special case of the Milgrom-Weber setup, we ve now found that

Chapter 9 The IS LM FE Model: A General Framework for Macroeconomic Analysis

CUR 412: Game Theory and its Applications, Lecture 4

13.1 Auction Classification

Chapter 021 Credit and Inventory Management

II. Determinants of Asset Demand. Figure 1

Agent-Based Systems. Agent-Based Systems. Michael Rovatsos. Lecture 11 Resource Allocation 1 / 18

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

AS/ECON 2350 S2 N Answers to Mid term Exam July time : 1 hour. Do all 4 questions. All count equally.

Mechanism Design and Auctions

Transcription:

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 of auctions and definition of optimal strategies 2. Common property resources: theory and example 1. AUCTIONS 1.1 Types of auctions and characteristics 1.2 Definitions and terminology 1.3 Optimal bidding strategies in auctions 1.1 Types of auctions and characteristics There are many different types of auctions. The main differences affect the: Format of the auction process Information available about the good bought 1.1.1 Different types of Auction Formats There are two main types of auctions, each of which then includes many possible variants. We will analyze the most important ones. Open outcry auction: The price has to be openly declared by the buyers; auction proceeds until the final price has been reached. Two main types: o Ascending (English auction): Auctioneer announces ever increasing prices to solicit bids. Continues until one person offers the highest price and no-one else offers more. o Descending (Dutch auction): Auctioneer announces decreasing prices until someone signals the intention to buy. Sealed bid auction: Every buyer puts a bid into an envelope and gives it to the seller at the same time. o First price: The buyer with the highest offer wins the auction and has to buy the product at the price he/she offered o Second price: The buyer with the highest offer wins the auction and has to buy the product at the SECOND highest price offered for the good 1

1.1.2 Different kinds of information availability in auctions There are two main cases we have to analyze: Private Valuation Auction: each bidder has private information about his/her own personal individual valuation of the good auctioned. Different people have different valuation. Example: Artwork that is bought for personal enjoyment.. Common Value Auctions: each bidder has private information about the value of the object auctioned. But at the end of the day the object will be worth the same to all. Example: A group of friends bid to buy a jar full of quarters or companies that bid for an oil field NOTE 1: In most real world situations auctions have often a private as well as common value component. For example a profitable division of company will most probably also be profitable if it belonged to another company (common value component) but potential buyers might add different value as a result of the existence of economies of scale and/or scope (private component). 1.2 Definitions and terminology There are two important definitions we have to remember in auctions: Winner s curse: When bidders have common values, they tend to overbid since the bidder with the highest (over)estimate wins. If bidders correctly account for the Winner's Curse, of course, they will not overbid. Also, the Winner's Curse is not relevant when bidders have private values since, then, bidders know how much the object is worth to them. Bid Rigging: If in a sealed bid auction two or more bidders agree to submit a bid (which is the result of a prior agreement), with the objective of lowering the maximum price or signaling future bidding intentions, we are assisting to a case of bid rigging. This is illegal in most sealed bid auctions, in the auctioneer is not properly informed about the agreement. 1.3 Optimal bidding strategies in auctions Different auctions require different strategies. In general, there are two main rules that apply to certain auctions formats, regardless of the situation. In a second price private value auction, the dominant strategy is to bid the real valuation for the good In common value auctions, beware of the winner s curse. 2

2. COMMON PROPERTY RESOURCES 2.1 Description 2.2 Example of independent use of common resources 2.3 Example of coordinated use of common resources 2.1 Typical common property problems Common properties are defined as resources that can be used without payment by a large number of players who have access to them. The problem with common goods relies on the fact that the use by one player affects the others (creating an externality: see later). The failure to price these common resources results in the overuse and - eventually - exhaustion of these resources. Example: imagine an oil field. The more oil platforms that will be built on the oil field, the less pressure each platform will obtain, hence the less oil. 2.2 Example of independent use of common resources Let s consider again the example of the oil rigs seen in class. Let s define the following variables: N = total wells drilled q = average output per well Q = total production = Nq Furthermore, let s assume that: P = oil price = $15 per barrel Drilling cost = $ per well Finally, let s consider the following production function: Q = 1000N - N 2 NOTE: when the number of wells increases, the pressure of the oil fields will drop, thereby affecting negatively total production! Each developer works independently. If there are many independent developers working on the oil field and trying to maximize profits, the problem becomes the following. To the Firm i, the profit from one more well according to the data above - is given by the equation: Πi = P* Q = P * 1000N P* N 2 - Each developer will add more wells up to their own break-even point, which is defined as P * q This equation is solved for N = 900 wells = 15 2 ( 1000 N N ) N = 0 3

And the optimal quantity of oil produced amounts to: Q = 90,000 barrels The average output per well will be q = 100 barrels. Profits in this case will be: Πi = $15 * 100 - $ = $0 Graphically: Many independent developers 15,000 $ per well Value per well (MR to individual driller) MC 900 Number of wells 2.3 Example of coordinated use of common resources Let s now assume that all developers decide to form a joint venture for the usage of the oil field. This time, the optimization problem involves the whole community. The profit for the community of developers as a whole from the creation of drilling wells is given by the function: Πc = PQ - N = 15(1000N - N 2 ) - N If all developers behave as a single firm (a joint venture) and they ask a single manager to find the optimal amount of wells, the manager will decide to add up oil wells until the point where: dπc /dn = 15(1000-2N) - = 0 Solving for N determines the point that maximizes the community s profit function. 4

This equation is solved for: N = 450 wells And the optimal amount of oil produced is: Q = 247,500 barrels. The average production per well becomes: q = 550 barrels Finally, the profits for each developer become: Graphically: Π i = $3.04 million Joint Venture Management 15,000 $ per well Value per well MC 450 MR to the community Number of wells 5