On Hardness of Pricing Items for Single-Minded Bidders

  title={On Hardness of Pricing Items for Single-Minded Bidders},
  author={Rohit Khandekar and Tracy Kimbrel and Konstantin Makarychev and Maxim Sviridenko},
  booktitle={International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques},
We consider the following item pricing problem which has received much attention recently. A seller has an infinite numbers of copies of n items. There are m buyers, each with a budget and an intention to buy a fixed subset of items. Given prices on the items, each buyer buys his subset of items, at the given prices, provided the total price of the subset is at most his budget. The objective of the seller is to determine the prices such that her total profit is maximized. In this paper, we… 

On the hardness of pricing loss-leaders

First it is shown that it is NP-hard to get better than O(log log log n)-approximation when k ≥ 3, and a super-constant Unique-Games hardness for the highway-pricing problem as well as the graph-vertex-prices problem is shown.

Pricing Loss Leaders Can be Hard

  • Yi Wu
  • Computer Science
    Journal of Computer Science and Technology
  • 2012
It is proved that assuming the Unique Games Conjecture (UGC), there is no constant approximation algorithm for item pricing with prices below cost allowed even when each customer is interested in at most three items.

Pricing ordered items

It is shown that item-pricing guarantees an O(logk) approximation to the optimal (buy-many) revenue and a PTAS is provided for computing the optimal item-PRicing when k is constant and a matching lower bound is provided showing that the problem is (strongly) NP-hard even when k=1.

Multi-Attribute Profit-Maximizing Pricing Extended

This paper considers the case where each item has a constant number of attributes and each consumer would like to buy the items that satisfy her criteria in all attributes, and presents sublinear-approximation algorithms, thus breaking the previous barrier for two well-known variants of the problem.

Improved Hardness Results for Profit Maximization Pricing Problems with Unlimited Supply

This work considers profit maximization pricing problems, where a set of m customers and aSet of n items are given and the goal is to set the item prices so as to maximize the total profit.

Profit-maximizing pricing for tollbooths

It is shown that any solution to a naturally defined upward instance obtained from a tollbooth instance can be converted back to a solution to the orginial problem at a loss of at most a constant factor in the approximation.

Envy free chain store pricing

It is proved that in a case of constant price the problem is NP-Hard and a (1 − 1 over e)-approximation algorithm is presented for solving “Equal prices-Equal costs” and “Ways to make the maximum profit by initiating stores in them” versions of this problem.

On the complexity of the highway problem

A Sublogarithmic Approximation for Tollbooth Pricing on Trees

This work presents a deterministic algorithm for the tollbooth problem on trees whose approximation ratio is O(log m/log log m), where m denotes the number of edges in the underlying graph.

On Profit-Maximizing Pricing for the Highway and Tollbooth Problems

This work rules out the existence of an FPTAS by showing that even for the line case, the problem is strongly NP-hard, and shows that in the discount model, when some items are allowed to be priced below zero to improve the overall profit, the problems becomes even APX-hard.



A quasi-PTAS for profit-maximizing pricing on line graphs

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 client is specified

Single-minded unlimited supply pricing on sparse instances

Weak NP-hardness of the very restricted case in which the requested subsets are nested, i.e., contained inside each other or non-intersecting is shown, thereby resolving the previously open question whether the problem remainsNP-hard when the underlying graph is simply a line.

On profit-maximizing envy-free pricing

It is shown that computing envy-free prices to maximize the seller's revenue is APX-hard in both of these cases, and the corresponding mechanism design problem, in which the consumer's preferences are private values, is investigated and given a log-competitive truthful mechanism.

Competitive auctions

Approximation algorithms and online mechanisms for item pricing

The approximation algorithms can be fed into the generic reduction of Balcan et al.

Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations

Efficient algorithms that compute near-optimal prices for this problem, focusing on a commodity market, where the range of buyer budgets is small are provided.

Near-Optimal Pricing in Near-Linear Time

Near-linear and near-cubic time approximation schemes are designed under the assumption that the number of distinct items for sale is constant and the prices that maximize the revenue of the seller are calculated.

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

We prove that, assuming the Unique Games conjecture (UGC), every problem in the class of ordering constraint satisfaction problems (OCSPs) where each constraint has constant arity is approximation

Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph

We prove that approximating the max. acyclic subgraph problem within a factor better than 1/2 is unique games hard. Specifically, for every constant epsiv > 0 the following holds: given a directed

Optimal algorithms and inapproximability results for every CSP?

A generic conversion from SDP integrality gaps to UGC hardness results for every CSP is shown, which achieves at least as good an approximation ratio as the best known algorithms for several problems like MaxCut, Max2Sat, MaxDiCut and Unique Games.