Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games (Q6116265): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1137/21m140612x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1137/21M140612X / rank | |||
Normal rank | |||
Latest revision as of 19:36, 30 December 2024
scientific article; zbMATH DE number 7725765
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games |
scientific article; zbMATH DE number 7725765 |
Statements
Affine Relaxations of the Best Response Algorithm: Global Convergence in Ratio-Bounded Games (English)
0 references
11 August 2023
0 references
two-player noncooperative game
0 references
Nash equilibrium
0 references
existence and uniqueness
0 references
fixed point
0 references
contraction mapping
0 references
nonexpansive mapping
0 references
super monotone operator
0 references
best response algorithm
0 references
convex relaxation
0 references
nonconvex affine relaxation
0 references
global convergence
0 references
error bound
0 references
speed of convergence
0 references
potential game
0 references
zero-sum game
0 references
0 references
0 references
0 references
0 references
0 references
