294 search results - page 14 / 59 » The complexity of computing a Nash equilibrium |
104
click to vote
SIGECOM
2005
ACM
15 years 7 months ago
2005
ACM
In this paper we formulate the fixed budget resource allocation game to understand the performance of a distributed marketbased resource allocation system. Multiple users decide ...
111
click to vote
SIGECOM
2006
ACM
15 years 7 months ago
2006
ACM
Finding an equilibrium of an extensive form game of imperfect information is a fundamental problem in computational game theory, but current techniques do not scale to large games...
129
click to vote
ICALP
2003
Springer
15 years 6 months ago
2003
Springer
We study the number of steps required to reach a pure Nash Equilibrium in a load balancing scenario where each job behaves selfishly and attempts to migrate to a machine which will...
NIPS
2007
15 years 2 months ago
2007
Extensive games are a powerful model of multiagent decision-making scenarios with incomplete information. Finding a Nash equilibrium for very large instances of these games has re...
JAIR
2010
14 years 12 months ago
2010
We provide a series of algorithms demonstrating that solutions according to the fundamental game-theoretic solution concept of closed under rational behavior (CURB) sets in two-pl...