An algorithm for computing all Berge equilibria (Q275883): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1155/2015/862842 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027969106 / rank | |||
Normal rank | |||
Latest revision as of 21:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for computing all Berge equilibria |
scientific article |
Statements
An algorithm for computing all Berge equilibria (English)
0 references
26 April 2016
0 references
Summary: An algorithm is presented in this note for determining all Berge equilibria for an \(n\)-person game in normal form. This algorithm is based on the notion of disappointment, with the payoff matrix (PM) being transformed into a disappointment matrix (DM). The DM has the property that a pure strategy profile of the PM is a BE if and only if \((0,\dots,0)\) is the corresponding entry of the DM. Furthermore, any \((0,\dots,0)\) entry of the DM is also a more restrictive Berge-Vaisman equilibrium if and only if each player's BE payoff is at least as large as the player's maximin security level.
0 references
