5995 search results - page 210 / 1199 » Algorithmic Game Theory |
128
click to vote
IUI
2003
ACM
15 years 9 months ago
2003
ACM
We present a probabilistic model, based on Dynamic Decision Networks, to assess user affect from possible causes of emotional arousal. The model relies on the OCC cognitive theory...
129
Voted
COCO
2005
Springer
15 years 9 months ago
2005
Springer
We study the complexity of solving succinct zero-sum games, i.e., the games whose payoff matrix M is given implicitly by a Boolean circuit C such that M(i, j) = C(i, j). We comple...
141
click to vote
SIGECOM
2003
ACM
15 years 9 months ago
2003
ACM
Strategyproof cost-sharing mechanisms, lying in the core, that recover 1/a fraction of the cost, are presented for the set cover and facility location games: a=O(log n) for the fo...
139
click to vote
INFOCOM
2008
IEEE
15 years 10 months ago
2008
IEEE
—Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundament...
135
click to vote
RTAS
2008
IEEE
15 years 10 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...