A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On Hardness of Pricing Items for Single-Minded Bidders
[chapter]

2009
*
Lecture Notes in Computer Science
*

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

doi:10.1007/978-3-642-03685-9_16
fatcat:uugmry5ovzd63ael4memdhepru