17 search results - page 3 / 4 » On the Limitations of Greedy Mechanism Design for Truthful C... |
WINE
2010
Springer
13 years 4 months ago
2010
Springer
We consider the following combinatorial auction: Given a range space (U, R), and m bidders interested in buying only ranges in R, each bidder j declares her bid bj : R R+. We give...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
We consider the problem of designing truthful auctions, when the bidders' valuations have a public and a private component. In particular, we consider combinatorial auctions w...
SIGECOM
2009
ACM
14 years 23 days ago
2009
ACM
We analyze the problem of designing a truthful pay-per-click auction where the click-through-rates (CTR) of the bidders are unknown to the auction. Such an auction faces the class...
INFOCOM
2012
IEEE
11 years 8 months ago
2012
IEEE
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...