Preview

Game Theory 14.122: Handout #L Finding Pbe in Signaling Games

Powerful Essays
Open Document
Open Document
2912 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Game Theory 14.122: Handout #L Finding Pbe in Signaling Games
Game Theory 14.122: Handout #l Finding PBE in Signaling Games

1 General Strategy
In a 2 x 2 signaling game, there can be any or all of the following Perfect Bayesian Equilibria (PBE): both types of Player 1 may play pure strategies in equilibrium (if they play the same strategy, we say it is a pooling equilibrium; if they differ, we say it is a separating equilibrium); one type of Player 1 may play a pure strategy while the other plays a mixed strategy (leading to a semi-separating equilibrium); or both types of Player 1 may play mixed strategies. (We won’t deal with the latter case.) When looking for a PBE... 1. Decide whether you’re looking for a separating, pooling, or semi-separating equilibrium. 2. Assign a strategy (a message for each type) to Player 1; make sure it is not strictly dominated. 3. Derive beliefs for Player 2 according to Bayes’ rule at each information set reached with positive probability along the equilibrium path. Set arbitrary beliefs for Player 2 at information sets that are never reached along the equilibrium path. 4. Determine Player 2’s best response. 5. In view of Player 2’s response, check to see whether Player 1 has an incentive to deviate from the strategy you assigned her in any state of the world (in other words, for all types of Player 1). If she does not, you have found a PBE. If she does, this is not an equilibrium - return to step 2 and assign Player 1 a different strategy. 6. Once you have exhausted all possible strategies within an equilibrium subset, return to step 1 and select a different type of PBE.

2 Example
Nature moves first. With equal probabilities, Nature assigns Player 1 type t E {t1,t2).

Player 1 knows her type, and chooses whether to play L or R. Player 2 does not know what player’s 1 type is, but he sees whether she plays L or R. He chooses U or D.

Figure 1: Game The extensive form of the game and its payoffs are presented in Figure 1. For example, if Player 1 is of type tr and plays R, and

You May Also Find These Documents Helpful

  • Satisfactory Essays

    ECO 550 FINAL EXAM

    • 1006 Words
    • 5 Pages

    4. The starting point of many methods for predicting equilibrium strategy in sequential games is…

    • 1006 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    vi. SPLITTING PAIRS - Splitting cards of the same value (Dealt two 8's). Player must double original bet.…

    • 494 Words
    • 2 Pages
    Good Essays
  • Satisfactory Essays

    Problem 4 Set

    • 298 Words
    • 2 Pages

    b. Does the result of your answer change if the game is played an infinite number of times? Why or why not. Properly use game theoretic terminology in your answer.…

    • 298 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    Economic Eqilibriums

    • 1183 Words
    • 5 Pages

    1.Consider the following entry game. Here, firm B is an existing firm in the market, and firm A is a potential entrant. Firm A must decide whether to enter the market (play "enter") or stay out of the market (play "not enter"). If firm A decides to enter the market, firm B must decide whether to engage in a price war (play "hard"), or not (play "soft"). By playing "hard", firm B ensures that firm A makes a loss of $1 million, but firm B only makes $1 million in profits. On the other hand, if firm B plays "soft", the new entrant takes half of the market, and each firm earns profits of $5 million. If firm A stays out, it earns zero while firm B earns $10 million. Which of the following are Nash equilibrium strategies?…

    • 1183 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Discrete Mathematics

    • 954 Words
    • 4 Pages

    Part III: Create a tree that models the following scenario. A player decides to play a maximum of 4 times, betting on red each time. The player will quit after losing twice. In the tree, any possible last plays will be an ending point of the tree. Branches of the tree should indicate the winning or losing, and how that affects whether a new play is made.…

    • 954 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    This game is an asymmetric coordination game. Asymmetric coordination occurs when players cannot agree on a ranking of the possible coordination outcomes. There may be one outcome where one player disproportionately wins benefits but the other player disproportionately loses.…

    • 492 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    The Game of Pig Portfolio

    • 642 Words
    • 3 Pages

    The key ideas were developed in the unit through the presentation of many games and variations of those games to us. The key ideas helped us to solve the central problem by giving us many opportunities to learn how to solve strategies for probability games. In each different game there was a new game or variation in which we could find a new way to find optimal game strategies for probability games.…

    • 642 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    Managerial Economics

    • 696 Words
    • 3 Pages

    is where each player maximizes his own payoff given the action of the other player.…

    • 696 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Bsbwor501 Practice Exam

    • 2312 Words
    • 10 Pages

    24) Consider the following information for a simultaneous move game: If you advertise and your rival advertises, you each will earn $5 million in profits. If neither of you advertise, you will each earn $10 million in profits. However, if one of you advertises and the other does not, the firm that advertises will earn $15 million and the no advertising firm will earn $1 million. If you and your rival plan to be in business for only one year, the Nash equilibrium is…

    • 2312 Words
    • 10 Pages
    Satisfactory Essays
  • Good Essays

    “Every time you play a hand differently from the way you would if you could see all your opponents cards, they gain; and every time you play your hand the same way you would have played it if you could see all their cards, they lose.”…

    • 504 Words
    • 3 Pages
    Good Essays
  • Good Essays

    health-care and what to do began when former President Barack Obama promised to make health…

    • 1053 Words
    • 5 Pages
    Good Essays
  • Good Essays

    Let G be a finite connected, undirected graph, with G(E,V), where E is the set of all edges and V is the set of all vertices. Let there be two players on the graph, such that player 1 is the Robber R and player 2 is the cop C, who play a game S on G according to the following rules: first the cop C and then the robber R choose vertices on which they position themselves. Then they in turn, alternatively along the edges of G. The cop player c wins if he ever succeeds in catching the robber, i.e, occupying the same vertex as the robber player R at some point in the game. Correspondingly, the robber player R wins if he manages to always evade the cop player, i.e., not occupying the same vertex as the cop player C. This game is a perfect information game where both the cop player c and the robber player R can see the entire graph and each others information. The game in the form as just described, i.e. with complete information on both sides, has also been studied by Aigner and Fromme[1], Nowakowski and Winkler[2], Quilliot[3] and possibly others. Let τ denote the set of cop win strategies on a…

    • 3140 Words
    • 13 Pages
    Good Essays
  • Powerful Essays

    Prisoner Dilemma Problem

    • 4949 Words
    • 20 Pages

    model cooperation in open-source software development [2]. In this game, two players meet and either cooperate with each other, defect against each other, or have a mixed outcome where one defects while the other cooperates. Each player makes his choice at the same time. The name comes from the story of two prisoners, each asked separately to testify against the other. If they both refuse to talk (and thus cooperate with each other), then both are released. If they both agree to testify (defect) against the other, they both will be convicted. One could testify against the other, winning his freedom at the expense of the other (cooperating) player. Scoring is based on the outcome; a defecting player scores five points against a cooperating player. Two players who cooperate both do fairly well, scoring three points each, while two defecting players both do poorly, scoring only one point each. A player who cooperates with a…

    • 4949 Words
    • 20 Pages
    Powerful Essays
  • Powerful Essays

    will offer most benefits to those of you who are more confident – see end of…

    • 2400 Words
    • 19 Pages
    Powerful Essays
  • Good Essays

    Mr Jaša Andrenšek

    • 749 Words
    • 3 Pages

    Pure strategy equilibria of the game are: M&L (best response of student 1 is L if student 2 chooses M and vice-versa), H&H (best response of student is H if student 2 chooses H and vice-versa). Efficient outcome is not…

    • 749 Words
    • 3 Pages
    Good Essays

Related Topics