Iterative Deletion of Dominated Strategies

Поділитися
Вставка
  • Опубліковано 8 тра 2013
  • economicsdetective.com/
    As I mentioned before, not all games have a strictly dominant strategy. However, there's another way we can use the concept of strictly dominated strategies to find equilibria.
    Let's say we have another two-player game. The players have choices A, B, C, and D. Player 1's payoff is negative one if players play B,D, zero if they play B,C, or A,D, and one if they play A,C. Player 2's payoffs are five if they play A,C, and two if they play A,D, and... actually there's no point in me saying what his payoffs are in the other two cases, because we already have enough information to find an equilibrium.
    But how can that be? It's simple. Player 2 knows player 1's payoffs, and he knows that player 1 is rational. So he knows that player 1 will not play B, because player 1 is always better off playing A. B is strictly dominated by A, so player 2 can ignore the possibility that B will be played. So we can delete B as an option, and then we see that player 2 must choose C, as A,C gives him a larger payoff than does A,D.
    This might be an dominant strategy equilibrium depending on player 2's payoffs, but it doesn't have to be.
    Here's a more complicated example. There's no dominant strategy equilibrium here, but let's see if we can find an equilibrium by deleting the strictly dominated strategies.
    We can see that player 1 will never pick C because he's always better off choosing B, so let's delete that. Now, given that C has been deleted, F can be deleted also. A,F and B,F both give player 2 a payoff of zero, and he could get a payoff of one by playing G, so he won't play F. With F deleted, player 1 won't ever play A, since he can always be better off playing B. That leaves player 1 playing B for sure, and player 2 can clearly see that he get his highest payoff in B,D, so he can eliminate E and G.
    So there you have it, an equilibrium.

КОМЕНТАРІ • 25

  • @sreetamaray_
    @sreetamaray_ 4 роки тому +4

    GREAT GREAT WORK! Beautiful explanation!

  • @PunmasterSTP
    @PunmasterSTP Рік тому +1

    Very succinct and well-explained; thank you for sharing!

  • @MsEady123
    @MsEady123 3 роки тому +1

    This was so helpful. Thank you

  • @manasichhabra6572
    @manasichhabra6572 10 років тому +1

    I like this approach :)

  • @amoungstus
    @amoungstus 5 років тому

    Good video, using bigger matrix is a good visualization

  • @pontusliljeblad
    @pontusliljeblad 11 років тому +1

    great videos, keep em coming!

  • @Ineedhelpig1082
    @Ineedhelpig1082 5 років тому +1

    I’m confused at the key he’s using. What do all those values indicate?

  • @Meckka72
    @Meckka72 6 років тому +4

    Writing a paper in school about the Game Theory in general, would really like to get some explanation for the Bayesian Equilibrium and the Weak Perfect Bayesian Equilibrium. mind uploading a video for those?

    • @PunmasterSTP
      @PunmasterSTP Рік тому

      I know it's been half a decade, but I just came across your comment and was curious. How'd the paper and the rest of your classes go?

  • @Dururugi
    @Dururugi 6 років тому

    thanks!

  • @joesr31
    @joesr31 6 років тому +1

    Must the elimination always be alternating? like player 1 then player 2 then player 1....or can it be player 1 player1 player2 player 2?

    • @GarrettPetersen
      @GarrettPetersen  6 років тому +2

      joesr31 It doesn't have to be, but when you delete a strategy from player 1, it often creates a new dominated strategy for player 2.

    • @CrazyLikeChris
      @CrazyLikeChris 4 роки тому

      @@GarrettPetersen That makes things more confusing. so what is the best way to approach this? alternate or not?

  • @sitrakamatthieu
    @sitrakamatthieu 5 років тому

    Thank you !!!! :')

  • @RahulSinha15
    @RahulSinha15 5 років тому

    Nice :-) thank u.

  • @caesertullo1824
    @caesertullo1824 6 років тому

    so is D the best choice for P2? I'm a bit confused.

    • @bappibhai1
      @bappibhai1 4 місяці тому

      Steps
      1. P1 will never eliminate C as C is always < A & B
      2. P2 will consider step 1 and eliminate F as F as F is always < D, E & G (considering P1 will not chose C)
      3. P1 will consider both step 1 and step 2 and eliminate A as A is always < B (considering both players will not chose C and F)
      4. P2 will now consider all the above steps and will only chose D as P1 (as being rational) will always chose B and for P2 D > all other options if P1 choose B

  • @arnavgrover4631
    @arnavgrover4631 Місяць тому

    Can't find an easier explanation

  • @shahreartowhid878
    @shahreartowhid878 7 років тому +1

    Why F can be deleted? Please explain.

    • @GarrettPetersen
      @GarrettPetersen  7 років тому +1

      C is strictly dominated by B for player 1, so we delete it first. Then the remaining entries for F are strictly worse than E for player 2, so we can delete it.

  • @jhewitt2008
    @jhewitt2008 8 років тому

    Sick

  • @rtfherrd5658
    @rtfherrd5658 6 років тому

    matematica di tipo elliederico

  • @kyler3035
    @kyler3035 3 роки тому

    I’m extremely interested in game theory but I have not conceptualized the fundamentals , (poor education ). With that said I can safely say I have no fucking idea what’s going on here.
    I need a elementary breakdown, (faraday’s elementary) what do these values in the matrix represent? Why is one favored??? What the hell is going on??

    • @kyler3035
      @kyler3035 3 роки тому

      It’s not your fault, but I’m seriously disappointed I don’t get the most rudimentary concepts of this field.
      Any recommendations that might help would be welcome.

    • @augustocesarfg
      @augustocesarfg Рік тому

      @@kyler3035 still need help?