Sciweavers

94 search results - page 13 / 19
» An Algorithm for Multi-Unit Combinatorial Auctions
Sort
View
STOC
2009
ACM
112views Algorithms» more  STOC 2009»
14 years 7 months ago
A new approach to auctions and resilient mechanism design
We put forward a new approach to mechanism design, and exemplify it via a new mechanism guaranteeing significant revenue in unrestricted combinatorial auctions. Our mechanism ? su...
Jing Chen, Silvio Micali
SIGECOM
2004
ACM
135views ECommerce» more  SIGECOM 2004»
14 years 4 days ago
Applying learning algorithms to preference elicitation
We consider the parallels between the preference elicitation problem in combinatorial auctions and the problem of learning an unknown function from learning theory. We show that l...
Sébastien Lahaie, David C. Parkes
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 9 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
AMEC
2004
Springer
14 years 3 days ago
iAuctionMaker: A Decision Support Tool for Mixed Bundling
This paper presents iAuctionMaker as a novel tool that serves as a decision support for e-sourcing professionals on their pursuing of auction optimisation. Given a set of items to ...
Antonio Reyes-Moro, Juan A. Rodríguez-Aguil...
WINE
2010
Springer
189views Economy» more  WINE 2010»
13 years 4 months ago
Approximation Algorithms for Non-single-minded Profit-Maximization Problems with Limited Supply
We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the ...
Khaled M. Elbassioni, Mahmoud Fouz, Chaitanya Swam...