5995 search results - page 329 / 1199 » Algorithmic Game Theory |
200
Voted
AAAI
2007
15 years 9 months ago
2007
In timed, zero-sum games, the goal is to maximize the probability of winning, which is not necessarily the same as maximizing our expected reward. We consider cumulative intermedi...
142
click to vote
AAAI
2000
15 years 8 months ago
2000
Maxn (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow prunin...
223
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The goal of this project is to develop an agent capable of learning and behaving autonomously and making decisions quickly in a dynamic environment. The agent’s environment is a...
189
Voted
TCS
2010
15 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...
263
click to vote
WINE
2010
Springer
15 years 4 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...