2 search results - page 1 / 1 » Approximation Algorithms for Single-minded Envy-free Profit-... |
WINE
2010
Springer
13 years 2 months ago
2010
Springer
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 ...
ESA
2007
Springer
13 years 8 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...