533 search results - page 71 / 107 » Playing games with approximation algorithms |
JMLR
2010
13 years 2 months ago
2010
We present a new approximate inference algorithm for Deep Boltzmann Machines (DBM's), a generative model with many layers of hidden variables. The algorithm learns a separate...
AAAI
2007
13 years 10 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...
TCS
2010
13 years 6 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...
ACSC
2004
IEEE
13 years 11 months ago
2004
IEEE
Table 1 shows the payoff to player one. The same matrix also holds for player two. Player one can gain the maximum 5 points (T = 5) by defection if player two cooperates. However,...
SIGECOM
2005
ACM
14 years 1 months ago
2005
ACM
The family of Vickrey-Clarke-Groves (VCG) mechanisms is arguably the most celebrated achievement in truthful mechanism design. However, VCG mechanisms have their limitations. They...