New ${\bf \frac{3}{4}}$-Approximation Algorithms for the Maximum Satisfiability Problem
SIAM Journal on Discrete Mathematics
Approximation algorithms
On profit-maximizing envy-free pricing
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Mechanism Design via Machine Learning
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Single-minded unlimited supply pricing on sparse instances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation algorithms and online mechanisms for item pricing
EC '06 Proceedings of the 7th ACM conference on Electronic commerce
Pairwise independence and derandomization
Foundations and Trends® in Theoretical Computer Science
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic pricing for impatient bidders
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Online pricing for multi-type of items
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Online pricing for bundles of multiple items
Journal of Global Optimization
| Hi-index | 5.23 |
How should a seller price her goods in a market where each buyer prefers a single good among his desired goods, and will buy the cheapest such good, as long as it is within his budget? We provide efficient algorithms that compute near-optimal prices for this problem, focusing on a commodity market, where the range of buyer budgets is small. We also show that our LP rounding based technique easily extends to a different scenario, in which the buyers want to buy all the desired goods, as long as they are within budget.