Revenue maximization in the dynamic knapsack problem

We analyze maximization of revenue in the dynamic and stochastic knapsack problem where a given capacity needs to be allocated by a given deadline to sequentially arriving agents. Each agent is described by a two-dimensional type that reflects his capacity requirement and his willingness to pay per unit of capacity. Types are private information. We first characterize implementable policies. Then we solve the revenue maximization problem for the special case where there is private information about per-unit values, but capacity needs are observable. After that we derive two sets of additional conditions on the joint distribution of values and weights under which the revenue maximizing policy for the case with observable weights is implementable, and thus optimal also for the case with twodimensional private information. In particular, we investigate the role of concave continuation revenues for implementation. We also construct a simple policy for which per-unit prices vary with requested weight but not with time, and we prove that it is asymptotically revenue maximizing when available capacity and time to the deadline both go to infinity. This highlights the importance of nonlinear as opposed to dynamic pricing.

[1]  W. M. Kincaid,et al.  An inventory pricing problem , 1963 .

[2]  C. Derman,et al.  A Sequential Stochastic Assignment Problem , 1972 .

[3]  S. Albright.  Optimal Sequential Assignments with Random Arrival Times , 1974 .

[4]  Roger B. Myerson,et al.  Optimal Auction Design , 1981, Math. Oper. Res..

[5]  R. Zeckhauser,et al.  Optimal Selling Strategies: When to Haggle, When to Hold Firm , 1983 .

[6]  J. Rochet.  The taxation principle and multi-time Hamilton-Jacobi equations☆ , 1985 .

[7]  Keith W. Ross,et al.  The stochastic knapsack problem , 1989, IEEE Trans. Commun..

[8]  G. Ryzin,et al.  Optimal dynamic pricing of inventories with stochastic demand over finite horizons , 1994 .

[9]  Martin L. Puterman,et al.  Markov Decision Processes: Discrete Stochastic Dynamic Programming , 1994 .

[10]  M. Armstrong.  Multiproduct Nonlinear Pricing , 1996 .

[11]  J. Papastavrou,et al.  The Dynamic and Stochastic Knapsack Problem with Deadlines , 1996 .

[12]  Susana V. Mondschein,et al.  Periodic Pricing of Seasonal Products in Retailing , 1997 .

[13]  E. Stacchetti,et al.  Multidimensional Mechanism Design for Auctions with Externalities , 1999 .

[14]  Yeon-Koo Che,et al.  The Optimal Mechanism for Selling to a Budget-Constrained Buyer , 2000, J. Econ. Theory.

[15]  Anton J. Kleywegt,et al.  The Dynamic and Stochastic Knapsack Problem with Random Sized Items , 2001, Oper. Res..

[16]  J. Rochet,et al.  The Economics of Multidimensional Screening , 2003 .

[17]  Pinar Keskinocak,et al.  Dynamic pricing in the presence of inventory considerations: research overview, current practices, and future directions , 2003, IEEE Engineering Management Review.

[18]  W. Lieberman.  The Theory and Practice of Revenue Management , 2005 .

[19]  Benny Moldovanu,et al.  Priority Auctions and Queue Disciplines That Depend on Processing Time , 2005, Manag. Sci..

[20]  Garud Iyengar,et al.  Optimal Procurement Auctions of Divisible Goods with Capacitated Suppliers , 2006 .

[21]  G. Iyengar,et al.  Optimal procurement mechanisms for divisible goods with capacitated suppliers , 2008 .

[22]  Multidimensional screening, affliation, and fullseparation , 2007 .

[23]  R. McAfee,et al.  Dynamic pricing in the airline industry , 2007 .

[24]  Multidimensional Screening, Affiliation, and Full Separation , 2007 .

[25]  Mallesh M. Pai,et al.  Optimal Dynamic Auctions , 2008 .

[26]  David D. Yao,et al.  The Stochastic Knapsack Revisited: Switch-Over Policies and Dynamic Pricing , 2008, Oper. Res..

[27]  Alex Gershkov,et al.  Dynamic Revenue Maximization with Heterogeneous Objects: A Mechanism Design Approach , 2009 .

[28]  U. Rieder,et al.  Markov Decision Processes , 2010 .