首页 > 代码库 > Learning in Two-Player Matrix Games

Learning in Two-Player Matrix Games

3.2 Nash Equilibria in Two-Player Matrix Games

For a two-player matrix game, we can set up a matrix with each element containing a reward for each joint action pair. Then the reward function 技术分享 for player 技术分享 becomes a matrix.

A two-player matrix game is called a zero-sum game if the two player are fully competitive. In this way, we have 技术分享. A zero-sum game has a unique NE in the sense of the expected reward. This means that, although each player may have multiple NE strategies in a zero-sum game, the value of the expected reward 技术分享 under these NE strategies will be the same. A general-sum matrix game refers to all types of matrix games. In a general-sum matrix game, the NE is no longer unique and the game might have multiple NEs.

For a two-player matrix game, we define 技术分享 as the set of all probability distributions over player 技术分享‘s action set 技术分享. Then 技术分享 becomes

技术分享 (1)

An NE for a two-player matrix game is the strategy pair 技术分享 for two players such that, for 技术分享

技术分享 (2)

where 技术分享 denotes any other player than player 技术分享, and 技术分享 is the set of all probability distributions over player 技术分享‘s action set 技术分享.

Given that each player has two actions in the game, we can define a two-player two-action general-sum game as

技术分享 (3)

where 技术分享 and 技术分享 denote the reward to the row player (player 1) and the reward to the column player (player 2), respectively. The row player chooses action 技术分享 and the column player chooses action 技术分享. the pure strategies 技术分享 and 技术分享 are called a strict NE in pure strategies if

技术分享 (4)

where 技术分享 and 技术分享 denote any row other than row 技术分享 and any column other than column 技术分享,respectively.

Learning in Two-Player Matrix Games