Lecture19-new

Lecture19-new - 6.254 : Game Theory with Engineering...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 6.254 : Game Theory with Engineering Applications Lecture 19: Mechanism Design I Asu Ozdaglar MIT April 29, 2010 1 Game Theory: Lecture 19 Introduction Outline Mechanism design Revelation principle Incentive compatibility Individual rationality “Optimal” mechanisms Reading: Krishna, Chapter 5 Myerson, “Optimal Auction Design,” Mathematics of Operations Research , vol. 6, no. 1, pp. 58-73, 1981. 2 Game Theory: Lecture 19 Auction Theory Viewpoint Introduction In the next 3 lectures, we will study Mechanism Design, which is an area in economics and game theory that has an engineering perspective. The goal is to design economic mechanisms or incentives to implement desired objectives (social or individual) in a strategic setting–assuming that the different members of the society each act rationally in a game theoretic sense. Mechanism design has important applications in economics (e.g., design of voting procedures, markets, auctions), and more recently finds applications in networked-systems (e.g., Internet interdomain routing, design of sponsored search auctions). 3 Game Theory: Lecture 19 Auction Theory Viewpoint Auction Theory Viewpoint We first study the mechanism design problem in an auction theory context, i.e., we are interested in allocating a single indivisible object among agents. An auction is one of many ways that a seller can use to sell an object to potential buyers with unknown values. In an auction, the object is sold at a price determined by competition among buyers according to rules set by the seller (auction format), but the seller can use other methods. The question then is: what is the “best” way to allocate the object? Here, we consider the underlying allocation problem by abstracting away from the details of the selling format. 4 Game Theory: Lecture 19 Auction Theory Viewpoint Model We assume a seller has a single indivisible object for sale and there are N potential buyers (or bidders) from the set N = { 1, . . . , N } . Buyers have private values X i drawn independently from the distribution F i with associated density function f i and support X i = [ 0, w i ] . Notice that we allow for asymmetries among the buyers, i.e., the distributions of the values need not be the same for all buyers. We assume that the value of the object to the seller is 0. Let X = ∏ N j = 1 X j denote the product set of buyers’ values and let X- i = ∏ j 6 = i X j . We define f ( x ) to be the joint density of x = ( x 1 , . . . , x N ) . Since values are independently distributed, we have f ( x ) = f 1 ( x 1 ) × ··· × f N ( x N ) . Similarly, we define f- i ( x- i ) to be the joint density of x- i = ( x 1 , . . . , x i- 1 , x i + 1 , . . . , x N ) ....
View Full Document

This note was uploaded on 05/08/2010 for the course CS 6.254 taught by Professor Asuozdaglar during the Spring '10 term at MIT.

Page1 / 21

Lecture19-new - 6.254 : Game Theory with Engineering...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online