OurBigBook About$ Donate
 Sign in Sign up

Minmax payoff (v​i​=minσ−i​​maxσi​​Ui​(σi​,σ−i​))

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Game theory Repeated game
2026-10-25  0 By others on same topic  0 Discussions Create my own version
The lowest expected payoff to which a player's opponents can hold that player when the player chooses a best response. The opponents' permitted randomization and correlation conventions should be specified for games with several opponents. In a two-player finite game, this equals the player's maximum guaranteed expected payoff by the minimax theorem applied to that player's payoff matrix. This equality does not make the original two-player game a zero-sum game.

 Ancestors (6)

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

 Incoming links (4)

  • Folk theorem for repeated games
  • Individually rational payoff in a repeated game
  • Past exam of the MSc in advanced computer science course of the University of Oxford / 2021 / Computational game theory / 3 / a / Solution
  • Past exam of the MSc in advanced computer science course of the University of Oxford / 2023 / Computational game theory / 3 / 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