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...
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...
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...
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...
Maria-Florina Balcan, Avrim Blum, Jason D. Hartlin...
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 ...