6 search results - page 1 / 2 » Lipschitz Games |
CORR
2011
Springer
12 years 8 months ago
2011
Springer
The Lipschitz constant of a finite normal–form game is the maximal change in some player’s payoff when a single opponent changes his strategy. We prove that games with small ...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
TCIAIG
2010
12 years 11 months ago
2010
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
ECCC
2006
13 years 4 months ago
2006
We introduce a new algorithm and a new analysis technique that is applicable to a variety of online optimization scenarios, including regret minimization for Lipschitz regret func...
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
We consider the problem of minimum distortion intrinsic correspondence between deformable shapes, many useful formulations of which give rise to the NP-hard quadratic assignment p...