powerpoint presentationaada/courses/15251f15/www/slides/lec26.pdf · teachers: anil ada ariel...

27
CMU 15-251 Game theory Teachers: Anil Ada Ariel Procaccia (this time)

Upload: vanphuc

Post on 12-Apr-2018

219 views

Category:

Documents


6 download

TRANSCRIPT

CMU 15-251

Game theory

Teachers:

Anil Ada

Ariel Procaccia (this time)

Normal-Form Game

o 𝑁 = {1,… , 𝑛}

o 𝑆

o 𝑖 ∈ 𝑁 𝑢𝑖: 𝑆𝑛 → ℝ

j ∈ 𝑁 𝑠𝑗 ∈ 𝑆

𝑖 𝑢𝑖(𝑠1, … , 𝑠𝑛)

2

3

Selling ice cream at the beach. One day your cousin Ted shows up. His ice cream is identical!

You split the beach in half; you set up at 1/4. 50% of the customers buy from you. 50% buy from Teddy.

One day Teddy sets up at the 1/2 point! Now you serve only 37.5%!

• 𝑢𝑖 𝑠𝑖 , 𝑠𝑗 =

𝑠𝑖+𝑠𝑗

2, 𝑠𝑖 < 𝑠𝑗

1 −𝑠𝑖+𝑠𝑗

2, 𝑠𝑖 > 𝑠𝑗

1

2, 𝑠𝑖 = 𝑠𝑗

The Ice Cream Wars

• 𝑁 = 1,2

• 𝑆 = [0,1]

4

The prisoner’s dilemma

o

o

5

The prisoner’s dilemma

6

In real life

o

o

o

o

o

o

7

On TV

8

The professor’s dilemma

9

Nash equilibrium

𝒔 = 𝑠1… , 𝑠𝑛 ∈ 𝑆𝑛

∀𝑖 ∈ 𝑁, ∀𝑠𝑖′ ∈ 𝑆, 𝑢𝑖 𝒔 ≥ 𝑢𝑖(𝑠𝑖

′, 𝒔−𝑖)𝒔−𝑖 = 𝑠1, … , 𝑠𝑖−1, 𝑠𝑖+1, … , 𝑠𝑛

10

Nash equilibrium

1. 0

2. 1

3. 2

4. 3

11

Nash equilibrium

12

Russel Crowe was wrong

13

End of the Ice Cream Wars

14

Day 3 of the ice cream wars… Teddy sets up south of you! You go south of Teddy.

Eventually…

15

Does NE make sense?

• {2, … , 100}

• 𝑠 𝑡 𝑠 < 𝑡𝑠 + 2

𝑠 − 2

16

Back to prison

=

17

Anarchy and stability

o =

o =

18

Example: Cost sharing

• 𝑛𝐺

• 𝑖 𝑠𝑖 𝑡𝑖𝑠𝑖 → 𝑡𝑖

• 𝑒 𝑐𝑒•

19

𝑠2𝑠1

𝑡1 𝑡2

1010 10

1 1

11

Example: Cost sharing

• 𝑛𝑛

• 1

• ⇒ ≥ 𝑛

• ≤ 𝑛

o

o

20

𝑡

𝑠

𝑛 1

Example: Cost sharing

• 12

𝑛

2

21

𝑠1 𝑠2 𝑠𝑛

𝑡

0 0 0

1 1 1

2

Example: Cost sharing

• = 2

• ⇒

22

𝑠1 𝑠2 𝑠𝑛

𝑡

0 0 0

2

1

1

1

2

1

𝑛

Potential games

Φ: 𝑖=1𝑛 𝑆𝑖 → ℝ

𝑖 ∈ 𝑁 𝒔 ∈ 𝑖=1𝑛 𝑆𝑖

𝑠𝑖′ ∈ 𝑆𝑖cost𝑖 𝑠𝑖

′, 𝒔−𝑖 − cost𝑖 𝒔 = Φ 𝑠𝑖′, 𝒔−𝑖 −Φ(𝒔)

23

Potential games *

o 𝑛𝑒 𝒔 𝑒 𝒔

o

Φ 𝒔 =

𝑒

𝑘=1

𝑛𝑒(𝒔)𝑐𝑒𝑘

o𝑐𝑒

𝑛𝑒 𝒔 +1𝑐𝑒

𝑛𝑒 𝒔Δcost𝑖 = ΔΦ ∎

24

Potential games *

𝑂(log 𝑛)

o

𝒔 ≤ Φ 𝒔 ≤ 𝐻 𝑛 ⋅ cost(𝒔)

o 𝒔∗ Φ

o 𝒔∗

o 𝒔∗ ≤ Φ 𝒔∗ ≤ Φ OPT≤ 𝐻 𝑛 ⋅ cost(OPT) ∎

25

Cost sharing summary

o ∀ 𝒔, cost 𝒔 ≤ 𝑛 ⋅ cost(OPT)

o ∃ 𝒔 cost 𝒔 ≤ 𝐻 𝑛 ⋅ cost(OPT)

o ∃ 𝒔 cost 𝒔 ≥ 𝑛 ⋅ cost(OPT)

o ∀ 𝒔, cost 𝒔 ≥ 𝐻 𝑛 ⋅ cost(OPT)

26

What we have learned

o

o

o

o

o

o

27