Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation
スポンサーリンク
概要
- 論文の詳細を見る
When a store sells items to customers, the store wishes to decide the prices of the items to maximize its profit. If the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. It would be hard for the store to decide the prices of items. Assume that a store has a set V of n items and there is a set C of m customers who wish to buy those items. The goal of the store is to decide the price of each item to maximize its profit. We refer to this maximization problem as an item pricing problem. We classify the item pricing problems according to how many items the store can sell or how the customers valuate the items. If the store can sell every item i with unlimited (resp. limited) amount, we refer to this as unlimited supply (resp. limited supply). We say that the item pricing problem is single-minded if each customer j∈C wishes to buy a set ej⊆V of items and assigns valuation w(ej)≥0. For the single-minded item pricing problems (in unlimited supply), Balcan and Blum regarded them as weighted k-hypergraphs and gave several approximation algorithms. In this paper, we focus on the (pseudo) degree of k-hypergraphs and the valuation ratio, i. e., the ratio between the smallest and the largest valuations. Then for the single-minded item pricing problems (in unlimited supply), we show improved approximation algorithms (for k-hypergraphs, general graphs, bipartite graphs, etc.) with respect to the maximum (pseudo) degree and the valuation ratio.
- (社)電子情報通信学会の論文
- 2008-02-01
著者
-
Itoh Toshiya
Tokyo Inst. Technol. Tokyo Jpn
-
Itoh Toshiya
The Global Scientific Information And Computing Center (gsic) Tokyo Institute Of Technology
-
HAMANE Ryoso
Department of Information Processing, Tokyo Institute of Technology
-
HAMANE Ryoso
the Department of Information Processing, Tokyo Institute of Technology
関連論文
- FOREWORD (Special Section on Cryptography and Information Security)
- Approximation Algorithms for the Highway Problem under the Coupon Model
- Approximation Preserving Reductions among Item Pricing Problems
- Special Section on Cryptography and Information Security
- Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation