We consider a revenue maximization problem where we are selling a set of comparable items, each available in a certain quantity (possibly unlimited) to a set of bidders. Each bidde...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
We study a pricing problem where buyers with non-uniform demand purchase one of many items. Each buyer has a known benefit for each item and purchases the item that gives the larg...
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
We present approximation and online algorithms for a number of problems of pricing items for sale so as to maximize seller’s revenue in an unlimited supply setting. Our first r...