Paul Milgroms work on Auctions and Information: A Retrospective - - PowerPoint PPT Presentation

paul milgrom s work on auctions and information a
SMART_READER_LITE
LIVE PREVIEW

Paul Milgroms work on Auctions and Information: A Retrospective - - PowerPoint PPT Presentation

Paul Milgroms work on Auctions and Information: A Retrospective Vijay Krishna Nemmers Conference November 6, 2009 Scope of this talk Theory of single-object auctions Milgrom and Weber (1982) on symmetric auctions


slide-1
SLIDE 1

Paul Milgrom’s work on Auctions and Information: A Retrospective

Vijay Krishna

Nemmers Conference

November 6, 2009

slide-2
SLIDE 2

Scope of this talk

Theory of single-object auctions

Milgrom and Weber (1982) on symmetric auctions Engelbrecht-Wiggans, Milgrom and Weber (1983) on

informational asymmetries Plan

Brief account of preceding work Contributions Subsequent work on asymmetric auctions

slide-3
SLIDE 3

In the beginning ...

Vickrey (1961)

model of auctions as games of incomplete information compare performance of di¤erent formats expected revenue e¢ciency

slide-4
SLIDE 4

Vickrey (1961)

  • 1. independent private values model
  • 2. Dutch descending …rst-price auction (FPA)
  • 3. English ascending second-price auction (SPA)
  • 4. equilibrium of FPA (example)
  • 5. revenue equivalence (example)
  • 6. asymmetric …rst-price auctions (example)
  • 7. multi-unit Vickrey auction
slide-5
SLIDE 5

Revenue Equivalence Principle

Fix an auction A such that only winner pays. Increasing equilibrium βA W A(z) = expected price paid by winner who bids βA(z).

FPA

W FP(z) = βFP(z)

SPA

W SP(z) = E[Y1 j Y1 < z]

slide-6
SLIDE 6

Revenue Equivalence Principle

Can show by direct computation that

βFP(z) = E[Y1 j Y1 < z] and so (Vickrey, 1961 & 1962): W FP(z) = W SP(z)

But, need to abstract away from speci…cs ...

slide-7
SLIDE 7

Revenue Equivalence Principle

Theorem

If W A (0) = 0 = W B (0), then W A(x) = W B(x).

Proof: Let G (z) = Pr [Y1 < z] . Bidder’s problem

max

z

G (z) x G (z) W A(z)

Optimal to set z = x, so

g (x) x =

  • G (x) W A(x)

So

W A(x) = 1 G (x)

Z x

0 yg (y) dy

= E[Y1 j Y1 < z]

slide-8
SLIDE 8

IPV Model

?

Vickrey (1961) Optimal Auction Design Myerson (1981) Riley and Samuelson (1981) Information Economics Implementation Theory

HHH H j

slide-9
SLIDE 9

Common Value Model

True value V H Conditionally independent signals

Xi F ( j V = v) i.i.d.

Wilson (1967), Ortega-Reichert (1968) derived equilibrium in

FPA (also examples with closed-form solutions)

slide-10
SLIDE 10

MW’s General Symmetric Model

Interdependent values vi (x1, x2, ..., xN, s)

vi symmetric in xi

A¢liated signals f (x1, x2, ..., xN, s)

f symmetric in x

slide-11
SLIDE 11

MW’s General Symmetric Model

IPV model and CV model are special cases A¢liation assumption is key

inherited by order statistics monotone functions

slide-12
SLIDE 12

Main Results in MW

Characterizing symmetric equilibria in FP, SP and English

auctions

RSP RFP

> with strict a¢liation; private values OK

REng RSP

> with strict a¢liation, interdependence and N > 2

b

RA RA Public information release (as a policy) increases revenue

All standard auctions are ex post e¢cient

need single-crossing condition

slide-13
SLIDE 13

IPV and MW

Symmetric IPV Model MW Model Dutch FP Dutch FP English SP REng RSP RSP = RFP RSP RFP * b RA RA

slide-14
SLIDE 14

Equilibria of Standard Auctions

De…ne v (x, y) = E [V1 j X1 = x, Y1 = y] SPA:

βSP (x) = v (x, x)

with private values βSP (x) = x

FPA:

βFP (x) =

Z x

0 v (y, y) dL (y j x)

where L ( j x) is determined by G ( j x)

with private values βFP (x) = E [Y1 j Y1 < x]

slide-15
SLIDE 15

English Auction

An ex post equilibrium is

βN (x) = v (x, x, ..., x) βN1 (x, pN) = v (x, x, ..., x, xN) . . . βk(x, pk+1, ..., pN) | {z }

Drop-out prices

= v(x, x, ...x, xk+1, ..., xN | {z })

Drop-out signals

Given information inferred from drop-out prices, stay until price reaches value if all remaining bidders dropped out at this instant.

slide-16
SLIDE 16

Revenue Ranking Results

All the revenue ranking results, that is,

REng RSP RFP can be deduced by direct computation from the equilibrium strategies.

But, again helpful to abstract away from speci…cs ...

slide-17
SLIDE 17

Linkage Principle

Fix an auction A such that only winner pays. Increasing equilibrium βA. W A(z, x) = expected price paid by winner who bids βA(z)

when signal is x.

FPA

W FP(z, x) = βFP(z)

SPA

W SP(z, x) = E[βSP(Y1) j X1 = x, Y1 < z] When is W A(x, x) W B(x, x)?

slide-18
SLIDE 18

Linkage Principle

Theorem

If (i) W A

2 (x, x) W B 2 (x, x); and (ii) W A (0, 0) = 0 = W B (0, 0),

then W A(x, x) W B(x, x)

Proof: Let G (z j x) = Pr [Y1 < z j X1 = x] . Bidder’s problem in auction A

max

z

Z z

0 v (x, y) g (y j x) dy G (z j x) W A(z, x)

Optimal to set z = x, so

W A

1 (x, x) = g (x j x)

G (x j x)v (x, x) g (x j x) G (x j x)W A(x, x)

slide-19
SLIDE 19

Linkage Principle

Similarly, in auction B : W B

1 (x, x) = g (x j x)

G (x j x)v (x, x) g (x j x) G (x j x)W B(x, x) If we write ∆(x) = W A(x, x) W B(x, x) then ∆0(x) = g (x j x) G (x j x)∆(x) + [W A

2 (x, x) W B 2 (x, x)]

Since ∆(0) = 0 and ∆(x) < 0 implies ∆0(x) > 0, we have ∆(x) 0.

slide-20
SLIDE 20

Public Information Release

W FP(z, x) = βFP(z)

so W FP

2

(x, x) = 0 c

W FP(z, x) = E h βFP(z, S) j X1 = x i

so by a¢liation c

W FP

2

(x, x) 0 Linkage principle now implies that b

RFP RFP

Similar argument for REng RSP

slide-21
SLIDE 21

Theory and Policy

A¢liation is key for existence of monotone pure strategy

equilibria in FPA in asymmetric situations

Athey (2001) Reny & Zamir (2004) de Castro (2007) ("just right")

A¢liation + linkage principle ! advantages of open auctions

market design in other settings

slide-22
SLIDE 22

Empirical Work and Experiments

Hendricks, Pinkse and Porter (2003) use ex post value data to

show that bidding in (symmetric) o¤-shore oil auctions is consistent with equilibrium of MW model.

Kagel and Levin’s (2002) extensive work on experiments

concerning MW model.

slide-23
SLIDE 23

An Impossible Ideal

Beautiful deep theory Clean results Strong policy recommendations (open auctions, transparency) Empirical support

slide-24
SLIDE 24

Generalizations?

Can the linkage principle be generalized to accommodate

asymmetries among bidders? symmetric multi-unit auctions?

The two are closely related: even symmetric multi-unit

auctions lead to asymmetries

my bid for …rst unit may compete with your bid for second unit

slide-25
SLIDE 25

Asymmetries and Revenue Rankings

Even with asymmetric independent private values (F1 6= F2)

we know that RFP ? RSP Vickrey (1961)

Ranking depends on distributions

RFP ? RSP even if F1, F2 are stochastically ranked regular (truncated) Normals Maskin and Riley (2000) classi…cation.

Also, FP is ine¢cient.

slide-26
SLIDE 26

ppppppppppppppppppppppppppppppppppppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppp

values bids x2 x1 b2 b1 β1 β2

slide-27
SLIDE 27

Resale

Ine¢ciency leads to possibility of resale.

a simple model:

Stage 1: First-price auction

Price (winning bid) is announced

Stage 2: Winner (new owner) makes a take-it-or-leave-it o¤er

to other buyer

Note resale takes place under incomplete information, so still

ine¢cient

slide-28
SLIDE 28

Resale

Theorem

Suppose N = 2 and F1, F2 regular. Then with resale R

FP R SP

Hafalir and Krishna (2008) Extensions to N > 2?

slide-29
SLIDE 29

Public Information with Asymmetries: Example

Suppose X1, X2, S uniform i.i.d. and v1 (x1, x2, s) = x1 + 1

2 (x2 + s)

interdependent v2 (x1, x2, s) = x2 private

With no information release by seller, equilibrium in SPA

β1 (x1) = 2x1 + E [S] and β2 (x2) = x2

With information release,

b β1 (x1, s) = 2x1 + s and b β2 (x2) = x2

slide-30
SLIDE 30

Example (contd.)

Given x1 and x2, the (expected) prices are

P = min f2x1 + E [S] , x2g b P = E [min f2x1 + S, x2g]

But "min" is a concave function and so b

P < P.

In this example, release of information S = s decreases

revenue in a SPA: b RSP < RSP

Similar failure of linkage principle in multi-unit auctions (Perry

and Reny, 1999)

slide-31
SLIDE 31

Asymmetries and Revenue Rankings: Example

Suppose v1 (x1, x2, x3) =

1 2x1 + 1 2x2

common v2 (x1, x2, x3) =

1 2x1 + 1 2x2

common v3 (x1, x2, x3) = x3 private X1, X2, and X3 are i.i.d. uniform on [0, 1].

In this example

REng < RSP

Revenue rankings do not generalize to asymmetric situations.

slide-32
SLIDE 32

From Revenue to E¢ciency

MW paper derives very general and powerful results on

revenue comparisons in single-object symmetric settings.

As the examples show, general revenue ranking results are

unlikely to hold in more general situations

for instance, question regarding treasury bill auctions

(discriminatory vs. uniform-price) remains open Auction theory has turned to the question of e¢ciency

much of this work is about the e¢cient allocation of multiple

  • bjects in a private value setting (Larry Ausubel’s talk)

but question of allocating single objects in asymmetric settings

with interdependent values remains

slide-33
SLIDE 33

E¢cient Allocations

Suppose we have N buyers with values vi (x1, x2, ..., xN) Ex post e¢ciency means that if i gets object then

vi (x1, x2, ..., xN) vj (x1, x2, ..., xN) for j 6= i.

Maskin (1992) suggested that English auctions may allocate

e¢ciently in asymmetric settings

Proof for N = 2 (under single-crossing)

slide-34
SLIDE 34

E¢ciency under Asymmetries

Step 1: solve for inverse bidding strategies φ1 and φ2 such

that v1 (φ1 (p) , φ2 (p)) = p v2 (φ1 (p) , φ2 (p)) = p

Single-crossing guarantees monotone solution

Step 2: If p1 > p2 (1 wins), then we have

x1 = φ1 (p1) > φ1 (p2) (mono.) x2 = φ2 (p2) So

v1 (x1, x2) = v1 (φ1 (p1) , φ2 (p2)) > v1 (φ1 (p2) , φ2 (p2)) = p2

slide-35
SLIDE 35

E¢ciency under Asymmetries

We have argued that there is an ex post equilibrium

(distribution-free)

Is this ex post e¢cient?

  • Yes:

v1 (φ1 (p2) , φ2 (p2)) = v2 (φ1 (p2) , φ2 (p2)) = p2 v1 (φ1 (p2) , x2) = v2 (φ1 (p2) , x2) v1 (φ1 (p1) , x2) > v2 (φ1 (p1) , x2) (SC) v1 (x1, x2) > v2 (x1, x2)

slide-36
SLIDE 36

English Auctions

Maskin’s two-person result does not extend without

strengthening SC conditions (how my signal a¤ects aggregate value).

Theorem

Suppose single crossing in the "aggregate" is satis…ed. Then the English auction has an e¢cient ex post equilibrium.

Krishna (2002) (also, Wilson’s (1998) log-normal model) Dubra, Echenique and Manelli (2009) have recently provided

weaker su¢cient (and almost necessary) conditions.

The constructions generalize the ex post equilibrium

construction in MW

slide-37
SLIDE 37

English Auctions

Milgrom and Weber advocated English auctions on revenue

grounds (Linkage Principle)

revenue results do not extend to asymmetric situations, but ...

It turns out that even in asymmetric situations open auctions

have remarkable e¢ciency properties!

slide-38
SLIDE 38

Open Auctions

The general message that open auctions are advantageous is

powerful and still resonates in more general and realistic settings.

Bravo English auctions! Bravo Paul Milgrom!

slide-39
SLIDE 39

References

  • 1. Athey, S. (2001): “Single Crossing Properties and the

Existence of Pure Strategy Equilibria in Games of Incomplete Information,” Econometrica, 69, 861–889.

  • 2. de Castro, L. (2007): "A¢liation and Dependence in

Economic Models," Working Paper, University of Illinois.

  • 3. Dubra, J., F. Echenique and A. Manelli (2009): "English

Auctions and the Stolper-Samuelson Theorem," Journal of Economic Theory, 144, 825–849.

  • 4. Engelbrecht-Wiggans, R., P. Milgrom, and R. Weber (1983):

“Competitive Bidding and Proprietary Information,” Journal

  • f Mathematical Economics, 11, 161–169.
  • 5. Hafalir, I. and V. Krishna (2008): "Asymmetric Auctions with

Resale," American Economic Review, 98, 87–112.

slide-40
SLIDE 40
  • 6. Hendricks, K., J. Pinkse and R. Porter (2003): "Empirical

Implications of Equilibrium Bidding in First-Price, Symmetric Common Value Auctions," Review of Economic Studies, 70, 115–145.

  • 7. Kagel, J. and D. Levin (2002): Common Value Auctions,

Princeton University Press.

  • 8. Krishna, V. (2002): "Asymmetric English Auctions," Journal
  • f Economic Theory, 112, 261–288.
  • 9. Maskin, E. (1992): “Auctions and Privatization,” in H.

Siebert (ed.), Privatization, Kiel: Institut fur Weltwirtschaften der Universität Kiel, 115–136.

  • 10. Maskin, E., and J. Riley (2000): “Asymmetric Auctions,”

Review of Economic Studies, 67, 413–438.

slide-41
SLIDE 41
  • 11. Milgrom, P., and R. Weber (1982): “A Theory of Auctions

and Competitive Bidding,” Econometrica, 50, 1089–1122.

  • 12. Myerson, R. (1981): “Optimal Auction Design,” Mathematics
  • f Operations Research, 6, 58–73.
  • 13. Ortega Reichert, A. (1968): Models for Competitive Bidding

under Uncertainty, Ph.D. Dissertation (Technical Report No. 8), Department of Operations Research, Stanford University.

  • 14. Perry, M., and P. Reny (1999): “On the Failure of the Linkage

Principle in Multi-Object Auctions,” Econometrica, 67, 885–890.

  • 15. Reny, P. and S. Zamir (2004): "On the Existence of Pure

Strategy Monotone Equilibria in Asymmetric First-Price Auctions," Econometrica, 72, 1105–1125.

slide-42
SLIDE 42
  • 16. Riley, J., and W. Samuelson (1981): “Optimal Auctions,”

American Economic Review, 71, 381–392.

  • 17. Vickrey, W. (1961): “Counterspeculation, Auctions and

Competitive Sealed Tenders,” Journal of Finance, 16, 8–37.

  • 18. Vickrey, W. (1962): “Auctions and Bidding Games,” in

Recent Advances in Game Theory, Princeton Conference Series, 29, Princeton, NJ: Princeton University Press, 15–27.

  • 19. Wilson, R. (1967): “Competitive Bidding with Asymmetrical

Information,” Management Science, 13, 816–820.

  • 20. Wilson, R. (1998): “Sequential Equilibria of Asymmetric

Ascending Auctions: The Case of Log-Normal Distributions,” Economic Theory, 12, 433–440.