203 search results - page 11 / 41 » A New Derandomization of Auctions |
ECCC
2007
13 years 7 months ago
2007
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we introduce a new graph based bidding language for combinatorial auctions. In our language, each bidder submits to the arbitrator a generalized flow network (netbid...
AISS
2010
13 years 4 months ago
2010
One of the important debates in service-oriented architecture is the competitive conditions in the side of service provider and service consumer. In service-oriented architecture ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— We design truthful double spectrum auctions where multiple parties can trade spectrum based on their individual needs. Open, market-based spectrum trading motivates existing sp...
GLOBECOM
2008
IEEE
14 years 1 months ago
2008
IEEE
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...