224 search results - page 16 / 45 » Auctions with Severely Bounded Communication |
INFOCOM
2005
IEEE
14 years 29 days ago
2005
IEEE
— In this paper, information theoretic techniques are used to derive analytic expressions for the minimum expected length of control messages exchanged by proactive routing in a ...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
We describe a general technique for converting an online algorithm B to a truthtelling mechanism. We require that the original online competitive algorithm has certain "nicen...
SIGECOM
2010
ACM
14 years 6 days ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
DSD
2007
IEEE
13 years 7 months ago
2007
IEEE
The universal underlying assumption made today is that Systems on chip must maintain 100% correctness regardless of the application. This work advocates the concept that some appl...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—This paper is concerned with cellular systems with rate constraints in fading environments. We consider a simple but asymptotically optimal matched filtering/successive interfer...