Introduction to Mechanism Design Lirong Xia Voting game of - - PowerPoint PPT Presentation

introduction to mechanism design
SMART_READER_LITE
LIVE PREVIEW

Introduction to Mechanism Design Lirong Xia Voting game of - - PowerPoint PPT Presentation

Introduction to Mechanism Design Lirong Xia Voting game of strategic voters > > Alice Strategic vote > > Bob Strategic vote > > Carol Strategic vote Game theory is predictive How to design the rule of the


slide-1
SLIDE 1

Lirong Xia

Introduction to Mechanism Design

slide-2
SLIDE 2

Voting game of strategic voters

> >

Alice Bob Carol

> > > >

Strategic vote Strategic vote Strategic vote

slide-3
SLIDE 3

ØHow to design the “rule of the game”?

  • so that when agents are strategic, we can

achieve a given outcome w.r.t. their true preferences?

  • “reverse” game theory

ØExample: design a voting rule f so that

  • for every true preference profile D*
  • OutcomeOfGame(f, D*)=Plurality(D*)

3

Game theory is predictive

slide-4
SLIDE 4

Ø Mechanism design: Nobel prize in economics 2007 Ø VCG Mechanism: Vickrey won Nobel prize in economics 1996

4

Today’s schedule: mechanism design

Roger Myerson Leonid Hurwicz 1917-2008 Eric Maskin William Vickrey 1914-1996

slide-5
SLIDE 5

Ø Auction for one indivisible item Ø n bidders Ø Outcomes: { (allocation, payment) } Ø Preferences: represented by a quasi-linear utility function

  • every bidder j has a private value vj for the item. Her utility

is

  • vj - paymentj, if she gets the item
  • 0, if she does not get the item
  • suffices to only report a bid (rather than a total preorder)

Ø Vickrey auction (second price auction)

  • allocate the item to the agent with the highest bid
  • charge her the second highest bid

5

Example: second price auction

slide-6
SLIDE 6

6

Example

Kyle Stan Eric

$ 10

$70

$ 70 $ 100

$10 $70 $100

slide-7
SLIDE 7

Ø A game and a solution concept implement a function f *, if

  • for every true preference profile D*
  • f *(D*) =OutcomeOfGame(f, D*)

Ø f * is defined w.r.t. the true preferences Ø f is defined w.r.t. the reported preferences

Implementation

R1* s1 Outcome R2* s2 Rn* sn Mechanism f … …

Strategy Profile D True Profile D*

f *

slide-8
SLIDE 8

Ø With monetary transfers Ø Set of alternatives: A

  • e.g. allocations of goods

Ø Outcomes: { (alternative, payments) } Ø Preferences: represented by a quasi-linear utility function

  • every agent j has a private value vj* (a) for every a∈A. Her

utility is

uj*(a, p) = vj*(a) - pj

  • It suffices to report a value function vj

8

Mechanism design with money

slide-9
SLIDE 9

ØSocial welfare of a

  • SCW(a)=Σjvj*(a)

ØCan any (argmaxa SCW(a), payments) be implemented w.r.t. DSNE?

9

Can we adjust the payments to maximize social welfare?

slide-10
SLIDE 10

ØThe Vickrey-Clarke-Groves mechanism (VCG) is defined by

  • Alterative in outcome: a*=argmaxa SCW(a)
  • Payments in outcome: for agent j

pj= maxa Σi≠jvi (a) - Σi≠jvi (a*)

  • negative externality of agent j of its presence on
  • ther agents

ØTruthful, efficient

10

The Vickrey-Clarke-Groves mechanism (VCG)

slide-11
SLIDE 11

Ø Alternatives = (give to K, give to S, give to E) Ø a* = Ø p1 = 100 – 100 = 0 Ø p2 = 100 – 100 = 0 Ø p3 = 70 – 0 = 70

11

Example: auction of one item

Kyle Stan $10 $70 $100 Eric