OurBigBook About$ Donate
 Sign in Sign up

Constant-sum game (u1​+u2​=K)

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Game theory Zero-sum game
2026-10-25  0 By others on same topic  0 Discussions Create my own version
In a two-player constant-sum game, the sum of the two payoffs is the same constant K at every strategy profile. Replacing each player's payoff by ui​−K/2 gives a zero-sum game without changing best responses or Nash equilibria. If both players can guarantee K/2, then any Nash equilibrium gives each that value. An equilibrium in pure strategies must use pure strategies with that guarantee: otherwise the opponent could improve on K/2 by a unilateral deviation.

 Ancestors (6)

  1. Zero-sum game
  2. Game theory
  3. Mathematical optimization
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (3)

  • Constant-sum game
  • Discrete location game
  • Past exam of the computer science course of the University of Oxford / 2019 / Computational game theory / 1 / a / Solution

 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