The construction of a countable system of coalition-free equilibrium notions (Q1395308)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1940671
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The construction of a countable system of coalition-free equilibrium notions |
scientific article; zbMATH DE number 1940671 |
Statements
The construction of a countable system of coalition-free equilibrium notions (English)
0 references
1 July 2003
0 references
The author shows that a countable system of hierarchically related different equilibrium notions can be constructed on the basis of three types of noncooperative equilibria. Then, at least one equilibrium from this system exists for any game, and the strongest of the existing equilibria can always be found.
0 references
noncooperative games
0 references
equilibrium
0 references
countable system
0 references
payoff function
0 references
players
0 references
iterative procedure
0 references
0.8462812304496765
0 references
0.7799234390258789
0 references
0.7797592282295227
0 references
0.7620146870613098
0 references
