134 search results - page 3 / 27 » On the Complexity of Computing Values of Restricted Games |
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
126
Voted
ICALP
2009
Springer
16 years 2 months ago
2009
Springer
A stochastic game is a two-player game played on a graph, where in each state the successor is chosen either by one of the players, or according to a probability distribution. We s...
102
click to vote
ATAL
2010
Springer
15 years 2 months ago
2010
Springer
Empirical analyses of complex games necessarily focus on a restricted set of strategies, and thus the value of empirical game models depends on effective methods for selectively e...
122
Voted
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
It is self-evident that in numerous Multiagent settings, selfish agents stand to benefit from cooperating by forming coalitions. Nevertheless, negotiating a stable distribution of...
91
Voted
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
We study network load games, a class of routing games in networks which generalize selfish routing games on networks consisting of parallel links. In these games, each user aims t...