Convergence and approximation in potential games (Q441854)
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 6064138
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Convergence and approximation in potential games |
scientific article; zbMATH DE number 6064138 |
Statements
Convergence and approximation in potential games (English)
0 references
8 August 2012
0 references
high dimensional data
0 references
nonlinear dimensionality reduction
0 references
manifold embedding technique
0 references
geometry of data
0 references
Isomaps
0 references
maximum variance unfolding
0 references
locally linear embedding
0 references
local tangent space alignment
0 references
Laplacian eigenmaps
0 references
Hessian locally linear embedding
0 references
diffusion maps
0 references
0 references
0 references
The paper addresses the field of game theory and, in particular, convergence and approximation within potential games.NEWLINENEWLINEConvergence speed to approximately optimal states is investigated within selfish routing games and cut games. The authors provide bounds in terms of the number of rounds, model the sequential interaction between players by a best-response walk in the state graph; the goal is to bound the social value of the states at the end of these walks -- by taking into account the cut and the total happiness as the social functions.
0 references
0.9575471878051758
0 references
0.8427879214286804
0 references
0.8366276621818542
0 references
0.818252444267273
0 references
0.8153275847434998
0 references
