On Multi-demand Knapsack Pricing
Ling Gai · Journal of Biomathematics · 2009
We study the pricing of multi-demand knapsack problem to maximize the seller/supplier's revenue.There are n customers which wish to place items in the knapsack,each of them has a valuation for buying the corresponding spaces of the knapsack.The knapsack supplier decides the price and the corresponding allocation to customers.Assume that the pricing strategy must be envy-free,that is:the customers who succeed in getting space by paying the given price are most satisfied about the allocation.We design the competitive algorithms over the sum of customers' valuation, by composing the technique of packing algorithm.