10 search results - page 1 / 2 » Approximation Algorithms for Non-single-minded Profit-Maximi... |
133
Voted
WINE
2010
Springer
14 years 10 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 ...
111
Voted
ESA
2007
Springer
15 years 4 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...
88
Voted
FOCS
2008
IEEE
15 years 17 days ago
2008
IEEE
We present the first polynomial-time approximation algorithms for single-minded envy-free profit-maximization problems [13] with limited supply. Our algorithms return a pricing sc...
125
Voted
JCSS
2008
15 years 12 days ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
91
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...