6 search results - page 1 / 2 » On Hardness of Pricing Items for Single-Minded Bidders |
APPROX
2009
Springer
14 years 5 months ago
2009
Springer
SODA
2012
ACM
12 years 1 months ago
2012
ACM
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
SIGECOM
2006
ACM
14 years 4 months ago
2006
ACM
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...
ATAL
2007
Springer
14 years 5 months ago
2007
Springer
Distributed allocation and multiagent coordination problems can be solved through combinatorial auctions. However, most of the existing winner determination algorithms for combina...
EOR
2011
13 years 2 months ago
2011
Combinatorial auctions have been used in procurement markets with economies of scope. Preference elicitation is already a problem in single-unit combinatorial auctions, but it bec...