170 search results - page 18 / 34 » Parallel Computation of Nash Equilibria in N-Player Games |
UAI
2004
13 years 9 months ago
2004
We describe an algorithm for computing bestresponse strategies in a class of two-player infinite games of incomplete information, defined by payoffs piecewise linear in agents...
SODA
2004
ACM
13 years 9 months ago
2004
ACM
We study algorithmic questions concerning a basic microeconomic congestion game in which there is a single provider that offers a service to a set of potential customers. Each cus...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
It is frequently suggested that predictions made by game theory could be improved by considering computational restrictions when modeling agents. Under the supposition that player...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
Two-player games of billiards, of the sort seen in recent Computer Olympiads held by the International Computer Games Association, are an emerging area with unique challenges for ...
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 ...