287 search results - page 5 / 58 » On the Power of Randomization in Algorithmic Mechanism Desig... |
FOCS
2005
IEEE
14 years 29 days ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
MSWIM
2005
ACM
14 years 28 days ago
2005
ACM
We consider the problem of energy aware localized routing in ad hoc networks. In localized routing algorithms, each node forwards a message based on the position information about...
GECON
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
WINET
2002
13 years 7 months ago
2002
We present a game-theoretic treatment of distributed power control in CDMA wireless systems. We make use of the conceptual framework of noncooperative game theory to obtain a distr...
DCC
2000
IEEE
13 years 11 months ago
2000
IEEE
We present a novel algorithm that assigns codes to instructions during instruction code compression in order to minimize bus-related bit-toggling and thus reducing power consumpti...