Computing better approximate pure Nash equilibria in cut games via semidefinite programming (Q6499260)
From MaRDI portal
!
WARNING
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 7844625
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing better approximate pure Nash equilibria in cut games via semidefinite programming |
scientific article; zbMATH DE number 7844625 |
Statements
Computing better approximate pure Nash equilibria in cut games via semidefinite programming (English)
0 references
8 May 2024
0 references
approximate pure Nash equilibrium
0 references
cut games
0 references
randomized rounding
0 references
semidefinite programming
0 references
0 references
0 references
0 references
