Showing 1 - 10 of 25
We consider a revenue maximization problem where we are selling a set of m items, each of which available in a certain quantity (possibly unlimited) to a set of n bidders. Bidders are single minded, that is, each bidder requests exactly one subset, or bundle of items. Each bidder has a valuation...
Persistent link: https://www.econbiz.de/10011200251
We consider the problem to price (digital) items in order to maximize the revenue obtainable from a set of bidders. We suggest a natural monotonicity constraint on bundle prices, show that the problem remains NP-hard, and we derive a PTAS. We also discuss a special case, the highway pricing problem.
Persistent link: https://www.econbiz.de/10005209964
Persistent link: https://www.econbiz.de/10007723538
This paper is concerned with polynomial time approximations schemes for the generalized geometric problems with geographic clustering. We illustrate the approach on the generalized traveling salesman problem which is also known as Group-TSP or TSP with neighborhoods. We prove that under the...
Persistent link: https://www.econbiz.de/10011199135
We consider a Stackelberg pricing problem in directed networks:Tariffs (prices) have to be defined by an operator, the leader, for a subset of the arcs. Clients, the followers, choose paths to route their demand through the network selfishly and independently of each other, on the basis of...
Persistent link: https://www.econbiz.de/10011202013
Persistent link: https://www.econbiz.de/10005921403
Persistent link: https://www.econbiz.de/10005277478
Persistent link: https://www.econbiz.de/10009848587
Persistent link: https://www.econbiz.de/10009181188
Persistent link: https://www.econbiz.de/10008896830