Sciweavers

60 search results - page 2 / 12
» Approximation algorithms for combinatorial auctions with com...
Sort
View
SIGECOM
2008
ACM
152views ECommerce» more  SIGECOM 2008»
13 years 5 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
ATAL
2008
Springer
13 years 7 months ago
Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposi...
Brammert Ottens, Ulle Endriss
CORR
2010
Springer
147views Education» more  CORR 2010»
13 years 5 months ago
Single Parameter Combinatorial Auctions with Partially Public Valuations
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...
Gagan Goel, Chinmay Karande, Lei Wang
ICMAS
2000
13 years 6 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge
ACMICEC
2003
ACM
160views ECommerce» more  ACMICEC 2003»
13 years 10 months ago
An algorithm for computing the outcome of combinatorial auctions with proxy bidding
Combinatorial auctions are difficult to analyze in part because of the vast number of potential strategies available to the bidders. Proxy bidding interfaces limit the users’ s...
Peter R. Wurman, Gangshu Cai, Jie Zhong, Ashish Su...