Sciweavers

203 search results - page 15 / 41
» A New Derandomization of Auctions
Sort
View
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
14 years 1 months ago
Price prediction and insurance for online auctions
Online auctions are generating a new class of fine-grained data about online transactions. This data lends itself to a variety of applications and services that can be provided to...
Rayid Ghani
MOBIHOC
2010
ACM
13 years 5 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
ATAL
2009
Springer
14 years 2 months ago
Pick-a-bundle: a novel bundling strategy for selling multiple items within online auctions
In this paper, we consider the design of an agent that is able to autonomously make optimal bundling decisions when selling multiple heterogeneous items within existing online auc...
Ioannis A. Vetsikas, Alex Rogers, Nicholas R. Jenn...
ICALP
2009
Springer
14 years 7 months ago
Fast FAST
We present a randomized subexponential time, polynomial space parameterized algorithm for the k-Weighted Feedback Arc Set in Tournaments (k-FAST) problem. We also show that our alg...
Noga Alon, Daniel Lokshtanov, Saket Saurabh
CORR
2010
Springer
138views Education» more  CORR 2010»
13 years 7 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran