70 search results - page 8 / 14 » Polynomial Algorithms for Approximating Nash Equilibria of B... |
WINE
2007
Springer
14 years 24 days ago
2007
Springer
We present a computational approach to the saddle-point formulation for the Nash equilibria of two-person, zero-sum sequential games of imperfect information. The algorithm is a ï¬...
COCOA
2009
Springer
14 years 1 months 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...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We consider the problem of computing Nash Equilibria of action-graph games (AGGs). AGGs, introduced by Bhat and Leyton-Brown, is a succinct representation of games that e...
CDC
2010
IEEE
13 years 1 months ago
2010
IEEE
In this paper, we consider the development of single-timescale schemes for the distributed computation of Nash equilibria. In general, equilibria associated with convex Nash games ...
UAI
2004
13 years 8 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...