Scribd Logo
Upload

Welcome to Scribd!

  • 72 views

    Formalizing Perfect Information Extensive Form Games: Game Theory Course: Jackson, Leyton-Brown & Shoham

    Uploaded by

    Jon Himes
    - The document defines perfect information extensive-form games using a tuple that includes: players, actions, choice nodes, terminal nodes, a successor function, and utility functions. - Choice nodes are arranged in a tree structure to encode the history of play. - At each choice node, one player chooses from the set of possible actions at that node. - The successor function maps choices to new nodes or terminal nodes. - Utilities are assigned to terminal nodes to represent each player's preferences.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    Formalizing Perfect Information Extensive Form Games: Game Theory Course: Jackson, Leyton-Brown & Shoham

    Uploaded by

    Jon Himes
    72 views11 pages
    - The document defines perfect information extensive-form games using a tuple that includes: players, actions, choice nodes, terminal nodes, a successor function, and utility functions. - Choice nodes are arranged in a tree structure to encode the history of play. - At each choice node, one player chooses from the set of possible actions at that node. - The successor function maps choices to new nodes or terminal nodes. - Utilities are assigned to terminal nodes to represent each player's preferences.

    Original Title

    023_4-2.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    - The document defines perfect information extensive-form games using a tuple that includes: players, actions, choice nodes, terminal nodes, a successor function, and utility functions. - Choice nodes are arranged in a tree structure to encode the history of play. - At each choice node, one player chooses from the set of possible actions at that node. - The successor function maps choices to new nodes or terminal nodes. - Utilities are assigned to terminal nodes to represent each player's preferences.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    72 views11 pages

    Formalizing Perfect Information Extensive Form Games: Game Theory Course: Jackson, Leyton-Brown & Shoham

    Uploaded by

    Jon Himes
    - The document defines perfect information extensive-form games using a tuple that includes: players, actions, choice nodes, terminal nodes, a successor function, and utility functions. - Choice nodes are arranged in a tree structure to encode the history of play. - At each choice node, one player chooses from the set of possible actions at that node. - The successor function maps choices to new nodes or terminal nodes. - Utilities are assigned to terminal nodes to represent each player's preferences.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 11

    .

    Formalizing Perfect Information


    Extensive Form Games
    Game Theory Course:
    Jackson, Leyton-Brown & Shoham

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Introduction

    The normal form game representation does not incorporate

    any notion of sequence, or time, of the actions of the players


    The extensive form is an alternative representation that makes
    the temporal structure explicit.
    Two variants:
    perfect information extensive-form games
    imperfect-information extensive-form games

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N is a set of n players

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A is a (single) set of actions

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A
    Choice nodes and labels for these nodes:
    Choice nodes: H is a set of non-terminal choice nodes

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A
    Choice nodes and labels for these nodes:
    Choice nodes: H
    Action function: : H 7 2A assigns to each choice node a set of

    possible actions

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A
    Choice nodes and labels for these nodes:
    Choice nodes: H
    Action function: : H 7 2A
    Player function: : H 7 N assigns to each non-terminal node h a

    player i N who chooses an action at h

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A
    Choice nodes and labels for these nodes:
    Choice nodes: H
    Action function: : H 7 2A
    Player function: : H 7 N

    Terminal nodes: Z is a set of terminal nodes, disjoint from H

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A
    Choice nodes and labels for these nodes:
    Choice nodes: H
    Action function: : H 7 2A
    Player function: : H 7 N

    Terminal nodes: Z
    Successor function: : H A 7 H Z maps a choice node

    and an action to a new choice node or terminal node such that


    for all h1 , h2 H and a1 , a2 A, if (h1 , a1 ) = (h2 , a2 ) then
    h1 = h2 and a1 = a2
    Choice nodes form a tree: nodes encode history
    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Definition
    A (finite) perfect-information game (in extensive form) is defined by
    the tuple (N, A, H, Z, , , , u), where:
    Players: N
    Actions: A
    Choice nodes and labels for these nodes:
    Choice nodes: H
    Action function: : H 7 2A
    Player function: : H 7 N

    Terminal nodes: Z
    Successor function: : H A 7 H Z
    Utility function: u = (u1 , . . . , un ); ui : Z 7 R is a utility

    function for player i on the terminal nodes Z


    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    Example: the sharing game

    1
    H
    
    HH
    
    
    
    20
    11 HHH
    02
    
    
    H
    
    HH
    H 2
    2 
    2
    A
    A
    A
    
    A
    
    A
    
    no 
    no 
    no  AA yes
    A yes
    A yes
    A
    
    A
    
    A
    
    A
    
    A
    
    A
    
    q

    (0,0)

    (2,0)

    (0,0)

    (1,1)

    (0,0)

    (0,2)

    Game Theory Course: Jackson, Leyton-Brown & Shoham

    Formalizing Perfect InformationExtensive Form Games

    You might also like