Sciweavers

94 search results - page 8 / 19
» An Algorithm for Multi-Unit Combinatorial Auctions
Sort
View
87
Voted
SODA
2010
ACM
169views Algorithms» more  SODA 2010»
16 years 3 days ago
VC v. VCG: Inapproximability of Combinatorial Auctions via Generalizations of the VC Dimension
Elchanan Mossel, Christos Papadimitriou, Michael S...
78
Voted
SODA
2010
ACM
115views Algorithms» more  SODA 2010»
15 years 1 months ago
Inapproximability for VCG-Based Combinatorial Auctions
David Buchfuhrer, Shaddin Dughmi, Hu Fu, Robert Kl...
138
Voted
ICALP
2010
Springer
15 years 4 months ago
On the Limitations of Greedy Mechanism Design for Truthful Combinatorial Auctions
We study the combinatorial auction (CA) problem, in which m objects are sold to rational agents and the goal is to maximize social welfare. Of particular interest is the special ca...
Allan Borodin, Brendan Lucier
125
Voted
CEC
2008
IEEE
15 years 9 months ago
Differential evolution for discrete optimization: An experimental study on Combinatorial Auction problems
: Differential evolutionary (DE) mutates solution vectors by the weighted difference of other vectors using arithmetic operations. As these operations cannot be directly extended t...
Jingqiao Zhang, Viswanath Avasarala, Arthur C. San...
113
Voted
CORR
2010
Springer
147views Education» more  CORR 2010»
15 years 2 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