CMSC 474, Introduction to Game Theory Introduction to Auctions

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

Lecture 6 Applications of Static Games of Incomplete Information

SI Game Theory, Fall 2008

Auction is a commonly used way of allocating indivisible

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

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

Social Network Analysis

ECON Microeconomics II IRYNA DUDNYK. Auctions.

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

Bayesian games and their use in auctions. Vincent Conitzer

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

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

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

Auctions and Common Property

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

Strategy -1- Strategic equilibrium in auctions

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 )

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

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

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

CMSC 858F Introduction to Game Theory*

Chapter 17 Auctions and Bargaining. Outline. Auctions

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

Game Theory. Jiang, Bo ( 江波 )

Bayesian Nash Equilibrium

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

Game Theory Problem Set 4 Solutions

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

Auction Theory: Some Basics

Game Theory and Auctions

CMSC 474, Introduction to Game Theory 16. Behavioral vs. Mixed Strategies

1 Theory of Auctions. 1.1 Independent Private Value Auctions

COMP/MATH 553 Algorithmic Game Theory Lecture 2: Mechanism Design Basics. Sep 8, Yang Cai

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

HW Consider the following game:

CUR 412: Game Theory and its Applications, Lecture 4

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

Game Theory Lecture #16

Algorithmic Game Theory

ECO 426 (Market Design) - Lecture 11

Auctions. Market Design. University of Notre Dame. Market Design (ND) Auctions 1 / 61

CMSC 474, Introduction to Game Theory 20. Shapley Values

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

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

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

Negotiation Master Course NEGOTIATION 9/12/09

CUR 412: Game Theory and its Applications, Lecture 4

Lecture 5 - Online Auctions

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

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

Problem Set 3: Suggested Solutions

Revenue Equivalence and Mechanism Design

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

Auctions: Types and Equilibriums

Microeconomics Comprehensive Exam

Strategy -1- Strategy

All Equilibrium Revenues in Buy Price Auctions

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

Spring 2017 Final Exam

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

Ten Little Treasures of Game Theory and Ten Intuitive Contradictions: Instructions and Data

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

Econ 101A Final exam May 14, 2013.

Auctions Introduction

KIER DISCUSSION PAPER SERIES

Game theory review. The English Auction How should bidders behave in the English auction?

Applying Revenue Management in Auction design. A.M.A. Sman BMI-paper

Stochastic Games and Bayesian Games

Revenue Equivalence and Income Taxation

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

Elements of auction theory. This material is not part of the course, but is included here for those who are interested

EconS Games with Incomplete Information II and Auction Theory

1 Intro to game theory

Game Theory Notes: Examples of Games with Dominant Strategy Equilibrium or Nash Equilibrium

Player 2 L R M H a,a 7,1 5,0 T 0,5 5,3 6,6

Auctions That Implement Efficient Investments

Notes for Section: Week 7

So we turn now to many-to-one matching with money, which is generally seen as a model of firms hiring workers

6.254 : Game Theory with Engineering Applications Lecture 3: Strategic Form Games - Solution Concepts

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

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

The Clock-Proxy Auction: A Practical Combinatorial Auction Design

WEIGRATE LTD AUCTION. White Paper & Business. Phone : Mail: Website: -

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

6.207/14.15: Networks Lecture 10: Introduction to Game Theory 2

In Class Exercises. Problem 1

Ad Auctions October 8, Ad Auctions October 8, 2010

Sustainability and competition in agri-food

Introduction to mechanism design. Lirong Xia

CUR 412: Game Theory and its Applications Final Exam Ronaldo Carpio Jan. 13, 2015

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.

G5212: Game Theory. Mark Dean. Spring 2017

Matching Markets and Google s Sponsored Search

Solution Problem Set 2

Auctions and Optimal Bidding

Microeconomic Theory II Preliminary Examination Solutions Exam date: August 7, 2017

Econ 101A Final exam May 14, 2013.

Games with Private Information 資訊不透明賽局

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

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

Transcription:

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 item to be sold) for which there is no well-established ongoing market Bidders make bids proposals to pay various amounts of money for the commodity The commodity is sold to the bidder who makes the largest bid Example applications Real estate, art, oil leases, electromagnetic spectrum, electricity, ebay, google ads Several kinds of auctions are incomplete-information (can be modeled as so-called Bayesian games) Private-value auctions Each bidder may have a different bidder value (BV), i.e., how much the commodity is worth to that bidder A bidder s BV is his/her private information, not known to others E.g., flowers, art, antiques

Types of Auctions Classification according to the rules for bidding English Dutch First price sealed bid Vickrey many others On the following pages, I ll describe several of these and will analyze their equilibria A possible problem is collusion (secret agreements for fraudulent purposes) Groups of bidders who won t bid against each other, to keep the price low Bidders who place phony (phantom) bids to raise the price (hence the auctioneer s profit) If there s collusion, the equilibrium analysis is no longer valid

English Auction The name comes from oral auctions in English-speaking countries, but I think this kind of auction was also used in ancient Rome Commodities: antiques, artworks, cattle, horses, wholesale fruits and vegetables, old books, etc. Typical rules: Auctioneer solicits an opening bid from the group Anyone who wants to bid should call out a new price at least c higher than the previous high bid (e.g., c = 1 dollar) The bidding continues until all bidders but one have dropped out The highest bidder gets the object being sold, for a price equal to his/her final bid For each bidder i, let v i = i s valuation of the commodity (private information) B i = i s final bid If i wins, then i s profit is π i = v i B i and everyone else s profit = 0

Nash equilibrium: English Auction (continued) Each bidder i participates until the bidding reaches v i, then drops out The highest bidder, i, gets the object, at price B i < v i, so π i = v i B i > 0 B i is close to the second highest bidder s valuation For every bidder j i, π j = 0 Why is this an equilibrium? Suppose bidder j deviates and none of the other bidders deviate If j deviates by dropping out earlier, Then j s profit will be 0, no better than before If u deviates by bidding B i > v j, then j win s the auction but j s profit is v j B j < 0, worse than before

English Auction (continued) If there is a large range of bidder valuations, then the difference between the highest and 2 nd -highest valuations may be large Thus if there s wide disagreement about the item s value, the winner might be able to get it for much less than his/her valuation Let n be the number of bidders The higher n is, the more likely it is that the highest and 2 nd -highest valuations are close Thus, the more likely it is that the winner pays close to his/her valuation

Let s Do an English Auction I will auction a one-dollar bill in an English auction It will be sold to the highest bidder, who must pay the amount of his/her bid Do not collude The minimum increment for a new bid is 10 cents

Modified English Auction Like the first, but with an additional rule The bill will be sold to the highest bidder, who must pay the amount of his/her bid The second-highest bidder must also pay his/her bid, but gets nothing Do not collude The minimum increment for a new bid is 10 cents

A Real-Life Analogy Swoopo: used to be a web site that auctioned items Now defunct (legal trouble, I think) Unlike ordinary auctions in which bids cost nothing, Swoopo required bidders to pay 60 cents/bid for each of your bids Bidders didn t pick the price they bid. Swoopo would increment the last offer by a fixed amount a penny, 6 cents, 12, cents that was determined before the start of the auction. Every time someone placed a bid, the auction got extended by 20 seconds Example from http://poojanblog.com/blog/2010/01/swoopo-psychology-game-theory-and-regulation Swoopo auctioned an ounce of gold (worth about $1,100) Selling price was $203.13 Increment was 1 cent => there were 20,313 bids At 60 cents per bid, Swoopo got $12,187.80 in revenue Swoopo netted about $11,000 Winner s total price was the selling price plus the price of his/her bids The winner probably paid a total of about $600