New algorithm for checking Pareto optimality in bimatrix games (Q2678596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: New algorithm for checking Pareto optimality in bimatrix games |
scientific article; zbMATH DE number 7644973
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New algorithm for checking Pareto optimality in bimatrix games |
scientific article; zbMATH DE number 7644973 |
Statements
New algorithm for checking Pareto optimality in bimatrix games (English)
0 references
23 January 2023
0 references
game theory
0 references
bimatrix games
0 references
Pareto optimality
0 references
checking algorithm
0 references
nonlinear transform
0 references
0 references
0 references
0.7777563333511353
0 references
0.7673239707946777
0 references
0.7642240524291992
0 references
0.7619286179542542
0 references
