68 search results - page 5 / 14 » New Algorithms for Approximate Nash Equilibria in Bimatrix G... |
SAGT
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. One reason for wanting to compute an (approximate) Nash equilibrium of a game is to predict how players will play. However, if the game has multiple equilibria that are f...
TCS
2010
13 years 5 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...
WINE
2007
Springer
14 years 1 months 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 ļ¬...
CDC
2010
IEEE
13 years 2 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 ...
SIGECOM
2004
ACM
14 years 23 days ago
2004
ACM
We provide eļ¬cient algorithms for ļ¬nding approximate BayesNash equilibria (BNE) in graphical, speciļ¬cally tree, games of incomplete information. In such games an agentās p...