Metraipolis › archive › dc_8597efdb53d6

Bimatrix game — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Bimatrix_game
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:58:17.078Z
SHA-256 of the archived text
cfeb4763376b71047a89dfae096c0f6d447d3ffc6cfc4afd5e6b7a2a3e27c000
Stable URL of this page
https://metraipolis.com/documento/dc_8597efdb53d6

How to cite

Bimatrix game — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Bimatrix_game (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_8597efdb53d6 (Metraipolis archive dc_8597efdb53d6, sha256 cfeb4763376b71047a89dfae096c0f6d447d3ffc6cfc4afd5e6b7a2a3e27c000)
BibTeX
@misc{dc8597efdb53d6,
  title = {Bimatrix game — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Bimatrix_game},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_8597efdb53d6; sha256 cfeb4763376b71047a89dfae096c0f6d447d3ffc6cfc4afd5e6b7a2a3e27c000},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Bimatrix_game. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In game theory, a bimatrix game is a simultaneous game for two players in which each player has a finite number of possible actions. The name comes from the fact that the normal form of such a game can be described by two matrices - matrix A {\displaystyle A} describing the payoffs of player 1 and matrix B {\displaystyle B} describing the payoffs of player 2. Player 1 is often called the "row player" and player 2 the "column player". If player 1 has m {\displaystyle m} possible actions and player 2 has n {\displaystyle n} possible actions, then each of the two matrices has m {\displaystyle m} rows by n {\displaystyle n} columns. When the row player selects the i {\displaystyle i} -th action and the column player selects the j {\displaystyle j} -th action, the payoff to the row player is A [ i , j ] {\displaystyle A[i,j]} and the payoff to the column player is B [ i , j ] {\displaystyle B[i,j]} . The players can also play mixed strategies. A mixed strategy for the row player is a non-negative vector x {\displaystyle x} of length m {\displaystyle m} such that: ∑ i = 1 m x i = 1 {\textstyle \sum _{i=1}^{m}x_{i}=1} . Similarly, a mixed strategy for the column player is a non-negative vector y {\displaystyle y} of length n {\displaystyle n} such that: ∑ j = 1 n y j = 1 {\textstyle \sum _{j=1}^{n}y_{j}=1} . When the players play mixed strategies with vectors x {\displaystyle x} and y {\displaystyle y} , the expected payoff of the row player is: x T A y {\displaystyle x^{\mathsf {T}}Ay} and of the column player: x T B y {\displaystyle x^{\mathsf {T}}By} .

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «game theory»).
Fonte: Wikipedia in inglese, voce «Bimatrix game» — https://en.wikipedia.org/wiki/Bimatrix_game
Wikidata Q3640076 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q3640076
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Bimatrix_game?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378999170, consultata il 2026-10-07T22:35:57.033Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 13240c07790a485699049c0cd71f3c361174ffda8c1e5050a430337166edc664