Skip to main content
Mathematics LibreTexts

11.1.1: Strictly Determined Games (Exercises)

  1. Last updated
  2. Save as PDF
  • Page ID
    37943

    • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    SECTION 11.1 PROBLEM SET: STRICTLY DETERMINED GAMES

    1. Determine whether the games are strictly determined. If the games are strictly determined, find the optimal strategies for each player and the value of the game.
    1. \(\left[\begin{array}{cc}
      1 & 2 \\
      -2 & 3
      \end{array}\right]\)
    1. \(\left[\begin{array}{ll}
      6 & 3 \\
      2 & 1
      \end{array}\right]\)
    1. \(\left[\begin{array}{ccc}
      -1 & -3 & 2 \\
      0 & 3 & -1 \\
      1 & -2 & 4
      \end{array}\right]\)
    1. \(\left[\begin{array}{ccc}
      2 & 0 & -4 \\
      3 & 4 & 2 \\
      0 & -2 & -3
      \end{array}\right]\)
    1. \(\left[\begin{array}{cc}
      0 & 2 \\
      -1 & -1 \\
      -1 & 1 \\
      3 & 2
      \end{array}\right]\)
    1. \(\left[\begin{array}{lll}
      5 & -3 & 2 \\
      3 & -1 & 4
      \end{array}\right]\)
    1. Two players play a game which involves holding out one or two fingers simultaneously. If the sum of the fingers is more than 2, Player II pays Player I the sum of the fingers; otherwise, Player I pays Player II the sum of the fingers.
    1. Write a payoff matrix for Player I.
    1. Find the optimal strategies for each player and the value of the game.
    1. A mayor of a large city is thinking of running for re-election, but does not know who his opponent is going to be. It is now time for him to take a stand for or against abortion. If he comes out against abortion rights and his opponent is for abortion, he will increase his chances of winning by 10%. But if he is against abortion and so is his opponent, he gains only 5%. On the other hand, if he is for abortion and his opponent against, he decreases his chance by 8%, and if he is for abortion and so is his opponent, he decreases his chance by 12%.
    1. Write a payoff matrix for the mayor.
    1. Find the optimal strategies for the mayor and his opponent.
    1. A man accused of a crime is not sure whether anybody saw him do it. He needs to make a choice of pleading innocent or pleading guilty to a lesser charge. If he pleads innocent and nobody comes forth, he goes free. However, if a witness comes forth, the man will be sentenced to 10 years in prison. On the other hand, if he pleads guilty to a lesser charge and nobody comes forth, he gets a sentence of one year and if a witness comes forth, he gets a sentence of 3 years.
    1. Write a payoff matrix for the accused.
    1. If you were his attorney, what strategy would you advise?

    This page titled 11.1.1: Strictly Determined Games (Exercises) is shared under a CC BY 4.0 license and was authored, remixed, and/or curated by Rupinder Sekhon and Roberta Bloom via source content that was edited to the style and standards of the LibreTexts platform; a detailed edit history is available upon request.