22 search results - page 3 / 5 » Truth Revelation in Approximately Efficient Combinatorial Au... |
INFOCOM
2012
IEEE
11 years 7 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...
ATAL
2006
Springer
13 years 9 months ago
2006
Springer
This paper develops a new combinatorial auction protocol called the Groves Mechanism with SubModular Approximation (GM-SMA). This protocol satisfies the following characteristics:...
WINE
2010
Springer
13 years 3 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...
FOCS
2005
IEEE
13 years 11 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
AI
2002
Springer
13 years 5 months ago
2002
Springer
Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-i...