Introducing open games Jules Hedges Joint work with Neil Ghani - - PowerPoint PPT Presentation

introducing open games
SMART_READER_LITE
LIVE PREVIEW

Introducing open games Jules Hedges Joint work with Neil Ghani - - PowerPoint PPT Presentation

Intro to game theory Compositionality Open games Introducing open games Jules Hedges Joint work with Neil Ghani Viktor Winschel Philipp Zahn University of Oxford February 24, 2017 Intro to game theory Compositionality Open games


slide-1
SLIDE 1

Intro to game theory Compositionality Open games

Introducing open games

Jules Hedges Joint work with Neil Ghani Viktor Winschel Philipp Zahn

University of Oxford

February 24, 2017

slide-2
SLIDE 2

Intro to game theory Compositionality Open games

Motivation: powerful machinery vs. hard problems

slide-3
SLIDE 3

Intro to game theory Compositionality Open games

What game theory is

Mathematical theory of interacting “rational” agents

slide-4
SLIDE 4

Intro to game theory Compositionality Open games

What game theory is

Mathematical theory of interacting “rational” agents Players make observations and then make choices

slide-5
SLIDE 5

Intro to game theory Compositionality Open games

What game theory is

Mathematical theory of interacting “rational” agents Players make observations and then make choices Group choices determine payoffs

slide-6
SLIDE 6

Intro to game theory Compositionality Open games

What game theory is

Mathematical theory of interacting “rational” agents Players make observations and then make choices Group choices determine payoffs “Local view” of rationality: players act to maximise payoff

slide-7
SLIDE 7

Intro to game theory Compositionality Open games

What game theory is

Mathematical theory of interacting “rational” agents Players make observations and then make choices Group choices determine payoffs “Local view” of rationality: players act to maximise payoff “Global view”: equilibrium strategies

slide-8
SLIDE 8

Intro to game theory Compositionality Open games

Example: penalty shootout

a, b ∈ {L, R}

slide-9
SLIDE 9

Intro to game theory Compositionality Open games

Example: penalty shootout

a, b ∈ {L, R} π(a, b) =

  • (+1, −1)

if a = b (−1, +1) if a = b

slide-10
SLIDE 10

Intro to game theory Compositionality Open games

Example: penalty shootout

a, b ∈ {L, R} π(a, b) =

  • (+1, −1)

if a = b (−1, +1) if a = b Unique (probabilistic) equilibrium: a = b = 1

2 |L + 1 2 |R

slide-11
SLIDE 11

Intro to game theory Compositionality Open games

Example: penalty shootout

a, b ∈ {L, R} π(a, b) =

  • (+1, −1)

if a = b (−1, +1) if a = b Unique (probabilistic) equilibrium: a = b = 1

2 |L + 1 2 |R

Nash’s theorem generalises this situation

slide-12
SLIDE 12

Intro to game theory Compositionality Open games

Example: the $$$ auction

slide-13
SLIDE 13

Intro to game theory Compositionality Open games

Game theory has some issues

Well known: equilibrium as behavioural prediction is experimentally falsified (e.g. ultimatum game)

slide-14
SLIDE 14

Intro to game theory Compositionality Open games

Game theory has some issues

Well known: equilibrium as behavioural prediction is experimentally falsified (e.g. ultimatum game) Harsanyi type spaces are accurate but underfit (and mathematically hard!)

slide-15
SLIDE 15

Intro to game theory Compositionality Open games

Game theory has some issues

Well known: equilibrium as behavioural prediction is experimentally falsified (e.g. ultimatum game) Harsanyi type spaces are accurate but underfit (and mathematically hard!) There is no accepted operational theory (or “equilibriating process”) (c.f. evolutionary game theory)

slide-16
SLIDE 16

Intro to game theory Compositionality Open games

Game theory has some issues

Well known: equilibrium as behavioural prediction is experimentally falsified (e.g. ultimatum game) Harsanyi type spaces are accurate but underfit (and mathematically hard!) There is no accepted operational theory (or “equilibriating process”) (c.f. evolutionary game theory) Serious computability/complexity issues (algorithmic game theory)

slide-17
SLIDE 17

Intro to game theory Compositionality Open games

Game theory has some issues

Well known: equilibrium as behavioural prediction is experimentally falsified (e.g. ultimatum game) Harsanyi type spaces are accurate but underfit (and mathematically hard!) There is no accepted operational theory (or “equilibriating process”) (c.f. evolutionary game theory) Serious computability/complexity issues (algorithmic game theory) Ordinary games do not compose/scale

slide-18
SLIDE 18

Intro to game theory Compositionality Open games

The fundamental headache of social science

Beliefs have causal effects

slide-19
SLIDE 19

Intro to game theory Compositionality Open games

What is compositionality?

A theory is compositional if:

slide-20
SLIDE 20

Intro to game theory Compositionality Open games

What is compositionality?

A theory is compositional if: Objects of interest are black boxes with interfaces

slide-21
SLIDE 21

Intro to game theory Compositionality Open games

What is compositionality?

A theory is compositional if: Objects of interest are black boxes with interfaces Objects can be composed without knowing how they are defined

slide-22
SLIDE 22

Intro to game theory Compositionality Open games

What is compositionality?

A theory is compositional if: Objects of interest are black boxes with interfaces Objects can be composed without knowing how they are defined Consequence: can easily change one component in a large structure

slide-23
SLIDE 23

Intro to game theory Compositionality Open games

What is compositionality?

A theory is compositional if: Objects of interest are black boxes with interfaces Objects can be composed without knowing how they are defined Consequence: can easily change one component in a large structure All reasoning is by structural induction on composition

slide-24
SLIDE 24

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language

slide-25
SLIDE 25

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language Internal reasoning in a logic, algebraic structure, category, etc.

slide-26
SLIDE 26

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language Internal reasoning in a logic, algebraic structure, category, etc. Most systems designed by human engineers

slide-27
SLIDE 27

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language Internal reasoning in a logic, algebraic structure, category, etc. Most systems designed by human engineers Organisations made of people (e.g. a company)

slide-28
SLIDE 28

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language Internal reasoning in a logic, algebraic structure, category, etc. Most systems designed by human engineers Organisations made of people (e.g. a company) Non-examples: Analytic solution of differential equations

slide-29
SLIDE 29

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language Internal reasoning in a logic, algebraic structure, category, etc. Most systems designed by human engineers Organisations made of people (e.g. a company) Non-examples: Analytic solution of differential equations Natural (biological) systems

slide-30
SLIDE 30

Intro to game theory Compositionality Open games

Examples of compositional systems

Any serious programming language Internal reasoning in a logic, algebraic structure, category, etc. Most systems designed by human engineers Organisations made of people (e.g. a company) Non-examples: Analytic solution of differential equations Natural (biological) systems Economic systems

slide-31
SLIDE 31

Intro to game theory Compositionality Open games

The compositionality hypothesis

If a theory is compositional, then reasoning with it is scalable

slide-32
SLIDE 32

Intro to game theory Compositionality Open games

The compositionality hypothesis

If a theory is compositional, then reasoning with it is scalable Hypothesis Compositionality is the only way to be scalable

slide-33
SLIDE 33

Intro to game theory Compositionality Open games

Compositionality is delicate

Compositionality is not all-or-nothing

slide-34
SLIDE 34

Intro to game theory Compositionality Open games

Compositionality is delicate

Compositionality is not all-or-nothing In programming languages it is harmed by: Goto Mutable global state Inheritance Type classes a la Haskell

slide-35
SLIDE 35

Intro to game theory Compositionality Open games

Compositionality is delicate

Compositionality is not all-or-nothing In programming languages it is harmed by: Goto Mutable global state Inheritance Type classes a la Haskell More generally: Leaky abstractions Emergent behaviour

slide-36
SLIDE 36

Intro to game theory Compositionality Open games

Compositionality via symmetric monoidal categories (1)

Objects (aka. interfaces, types, systems) X X

slide-37
SLIDE 37

Intro to game theory Compositionality Open games

Compositionality via symmetric monoidal categories (1)

Objects (aka. interfaces, types, systems) X X Morphisms (aka. black boxes, processes) f : X → Y X Y f

slide-38
SLIDE 38

Intro to game theory Compositionality Open games

Compositionality via symmetric monoidal categories (1)

Objects (aka. interfaces, types, systems) X X Morphisms (aka. black boxes, processes) f : X → Y X Y f Compound object X1 ⊗ X2 X1 X2

slide-39
SLIDE 39

Intro to game theory Compositionality Open games

Compositionality via symmetric monoidal categories (1)

Objects (aka. interfaces, types, systems) X X Morphisms (aka. black boxes, processes) f : X → Y X Y f Compound object X1 ⊗ X2 X1 X2 Monoidal product (aka. tensor product, simultaneous/spatial composition) f1 ⊗ f2 : X1 ⊗ X2 → Y1 ⊗ Y2 X1 X2 Y1 Y2 f1 f2

slide-40
SLIDE 40

Intro to game theory Compositionality Open games

Compositionality via symmetric monoidal categories (2)

Categorical composition (aka. sequential/temporal composition) g ◦ f : X → Z X Z f g Y

slide-41
SLIDE 41

Intro to game theory Compositionality Open games

Compositionality via symmetric monoidal categories (2)

Categorical composition (aka. sequential/temporal composition) g ◦ f : X → Z X Z f g Y f : I → X ⊗ Y g : X → Z h : X ⊗ Z → I h ◦ σZ,X ◦ (g ⊗ Y ) ◦ f : I → I f g h X Z Y

slide-42
SLIDE 42

Intro to game theory Compositionality Open games

Open games

A closed game consists of: A set Σ of strategy profiles A best response function B : Σ → P(Σ) An open game G : (X, S) → (Y , R) consists of: A set Σ of strategy profiles A play function PG : Σ × X → Y A coplay function CG : Σ × X × R → S A best response function BG : X × (Y → R) × Σ → P(Σ)

slide-43
SLIDE 43

Intro to game theory Compositionality Open games

Bimatrix game

A1 A2 U X R Y R

slide-44
SLIDE 44

Intro to game theory Compositionality Open games

Perfect information game

A1 A2 U X X R R X Y R

slide-45
SLIDE 45

Intro to game theory Compositionality Open games

Imperfect information

A1 f A2 U X X R R X X ′ Y R