130 search results - page 4 / 26 » Convergence Time to Nash Equilibria |
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...
157
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
145
click to vote
COCOA
2009
Springer
16 years 17 days ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
172
click to vote
TCS
2010
15 years 4 months ago
2010
Abstract. We study a general class of non-cooperative games coming from combinatorial covering and facility location problems. A game for k players is based on an integer programmi...
179
click to vote
IJCAI
2003
15 years 7 months ago
2003
We present a new class of games, local-effect games (LEGs), which exploit structure in a different way from other compact game representations studied in AI. We show both theoreti...