Quiz Space

Game Theory and Strategy · Quiz 2 · 1 Dec 2024 · September 2024 term

Question 10: Now assume that this game is repeated infinitely. If the…

Question 10

+1 markOne correct option

Now assume that this game is repeated infinitely. If the parties cooperate and sign a binding agreement on how much to campaign, they choose a1 = a2 = 0.
What will be the payoff of each player in each stage game if they stick to this agreement

  1. A

    -1.5

  2. B

    1

  3. C

    -1

  4. D

    0

Show answer

Correct answer

  • D

    0

See the whole paperTake it as a mock test

Question 10 of 25 in the IIT Madras BS Game Theory and Strategy (Game Theory) Quiz 2 paper sat on 1 Dec 2024, in the September 2024 term (IIT M DEGREE AN EXAM QDB2 01 Dec 2024). It carries 1 mark.

More questions from this paper

  1. Q1Suppose one ball is picked from the blue majority urn. What is the probability that the ball is blue?
  2. Q2What is the probability that the urn is blue-majority if the first student draws a red ball?
  3. Q3Now suppose, first three students draw the ball in the sequence (Blue, Blue, Red).\ What is the probability of getting …
  4. Q4Now suppose, first three students draw the ball in the sequence (Blue, Blue, Red).\ What is the probability of getting …
  5. Q5Now suppose, first three students draw the ball in the sequence (Blue, Blue, Red).\ What is the total probability of ge…
  6. Q6Now suppose, first three students draw the ball in the sequence (Blue, Blue, Red).\ What is the probability of urn bein…
  7. Q7If player 1 chooses 1.5 hour as his action, the best response of player 2 will be
  8. Q8How much negative campaign time each player will choose under a symmetric and unique Nash equilibrium?
  9. Q9Equilibrium payoff of each player will be
  10. Q11Now assume that this game is repeated infinitely. If the parties cooperate and sign a binding agreement on how much to …
  11. Q12Now assume that this game is repeated infinitely. If the parties cooperate and sign a binding agreement on how much to …
  12. Q13Given the following preference structure, find a stable matching system using the Gale–Shapley algorithm, when the wome…
  13. Q14Given the following preference structure, find a stable matching system using the Gale–Shapley algorithm, when the wome…
  14. Q15Given the following preference structure, find a stable matching system using the Gale–Shapley algorithm, when the wome…
  15. Q16Given the following preference structure, find a stable matching system using the Gale–Shapley algorithm, when the wome…
  16. Q17(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  17. Q18(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  18. Q19(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  19. Q20(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  20. Q21(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  21. Q22(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  22. Q23(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  23. Q24(Bayesian Game) Consider a variant of the situation modelled by Battle of Sexes (BoS) (as discussed in lectures) in whi…
  24. Q25Consider two statements about Borda count:\ I: Borda Count (ignoring ties) always produces a complete, transitive ranki…