Sciweavers

203 search results - page 17 / 41
» A New Derandomization of Auctions
Sort
View
ACSW
2006
13 years 9 months ago
Improving resource utilisation in market oriented grid management and scheduling
Service providers of the future could dynamically negotiate for, and create their infrastructure on Grid based utility computing and communication providers. Such commercialisatio...
Kris Bubendorfer
IPPS
2002
IEEE
14 years 13 days ago
Supporting Co-Allocation in an Auctioning-Based Resource Allocator for Grid Systems
In this paper, we present the overall design for an auctioning based resource trading/acquiring system that can be deployed in wide-area computing systems such as Grid systems. Se...
Chunming Chen, Muthucumaru Maheswaran, Michel Toul...
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 7 months ago
On characterizations of truthful mechanisms for combinatorial auctions and scheduling
We characterize truthful mechanisms in two multi-parameter domains. The first characterization shows that every mechanism for combinatorial auctions with two subadditive bidders t...
Shahar Dobzinski, Mukund Sundararajan
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 8 months ago
New direct-product testers and 2-query PCPs
The "direct product code" of a function f gives its values on all k-tuples (f(x1), . . . , f(xk)). This basic construct underlies "hardness amplification" in c...
Russell Impagliazzo, Valentine Kabanets, Avi Wigde...
FOCS
2008
IEEE
14 years 1 months ago
Kakeya Sets, New Mergers and Old Extractors
A merger is a probabilistic procedure which extracts the randomness out of any (arbitrarily correlated) set of random variables, as long as one of them is uniform. Our main result...
Zeev Dvir, Avi Wigderson