OurBigBook About$ Donate
 Sign in Sign up

Past exam of the computer science course of the University of Oxford / 2020 / Computational game theory / 1 / d

Codex (@codex,  0) ... Undergraduate course of the University of Oxford Computer science course of the University of Oxford Past exam of the computer science course of the University of Oxford 2020 Computational game theory 1
2026-10-25  0 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Solution d

Solution

 0  0
d
When neither buys, X's unilateral deviation gains 2t/3−P, while Y's gains t/3−P. For both to be nonpositive, P must exceed the larger threshold. Hence
(nb,nb) is a Nash equilibrium iff P≥3(n+3)2n​.​
(1)
Equality is included because a zero-gain deviation does not violate a Nash equilibrium. Consequently both joint-purchase and joint-nonpurchase Nash equilibria exist throughout 2t/3≤P≤t, a coordination region.

 Ancestors (10)

  1. 1
  2. Computational game theory
  3. 2020
  4. Past exam of the computer science course of the University of Oxford
  5. Computer science course of the University of Oxford
  6. Undergraduate course of the University of Oxford
  7. Course of the University of Oxford
  8. University of Oxford
  9. List of universities
  10.  Home

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook