Approximation Algorithms for Single-minded Envy-free Profit-maximization Problems with Limited Supply

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 scheme and a subset of customers that are designated the winners, which satisfy the envy-freeness constraint, whereas in our analyses, we compare the profit of our solution against the optimal value of the corresponding social-welfare-maximization (SWM) problem of finding a winner-set with maximum total value. Our algorithms take any LP-based -approximation algorithm for the corresponding SWM problem as input and return a solution that achieves profit at least OPT/O(

• Type: Conference
• Year: 2008
• Where: FOCS
• Authors: Maurice Cheung, Chaitanya Swamy
• Keywords: Corresponding Swm Problems, FOCS 2008, Swm Problems, Theoretical Computer Science, Umax