533 search results - page 52 / 107 » Playing games with approximation algorithms |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Negotiation techniques have been demonstrated to be effective in solving complex multi-objective problems. When the optimization process operates on continuous variables, it can b...
ICC
2007
IEEE
14 years 2 months ago
2007
IEEE
Abstract— We describe a decentralized learning-based activation algorithm for a ZigBee-enabled unattended ground sensor network. Sensor nodes learn to monitor their environment i...
SIAMCOMP
2008
13 years 7 months ago
2008
We consider a game-theoretical variant of the Steiner forest problem in which each player j, out of a set of k players, strives to connect his terminal pair (sj, tj) of vertices in...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold'em poker. The first player, GS3, is designed for playing limit Texas Hold'em, in ...