An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition

We examine a situation in which a decision-maker executes a sequence of resource allocation decisions over time, but the availability of the indivisible resources at future epochs is uncertain due to actions of competitors. We cast this problem as a specialized type of stochastic knapsack problem in which the uncertainty of item (resource) availability is induced by competitors concurrently filling their own respective knapsacks. Utilizing a multi-period bounded multiple-choice knapsack framework, we introduce a general discrete stochastic optimization model that allows a nonlinear objective function, cardinality constraints, and a knapsack capacity constraint. Utilizing a set of greedy selection rules and agent-based modeling to simulate the competitors' actions, we solve the problem with a stochastic ruler approach that incorporates beam search to determine item selection of the types specified by the solution representation. We illustrate the computational effectiveness of our approach on instances motivated by a sports league draft as well as generic problem instances based on the knapsack literature.

[1]  Andrew M. Colman,et al.  The complexity of cooperation: Agent-based models of competition and collaboration , 1998, Complex..

[2]  Ihsan Sabuncuoglu,et al.  Job shop scheduling with beam search , 1999, Eur. J. Oper. Res..

[3]  Mordechai I. Henig,et al.  Risk Criteria in a Stochastic Knapsack Problem , 1990, Oper. Res..

[4]  R. Carraway,et al.  An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns , 1993 .

[5]  Deeparnab Chakrabarty,et al.  Knapsack Problems , 2008 .

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

[7]  R. K. Wood,et al.  On a stochastic knapsack problem and generalizations , 1997 .

[8]  Alexander H. G. Rinnooy Kan,et al.  A Class of Generalized Greedy Algorithms for the Multi-Knapsack Problem , 1993, Discret. Appl. Math..

[9]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[10]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[11]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[12]  Steven J. Brams,et al.  Dividing the Indivisible , 2002 .

[13]  Xin Chen,et al.  Agent-based Simulation on Competition of e-Auction Marketplaces , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[14]  David L. Woodruff.  Advances in computational and stochastic optimization, logic programming, and heuristic search: interfaces in computer science and operations research , 1997 .

[15]  Louis Anthony Cox,et al.  Optimal access control for broadband services: Stochastic knapsack with advance information , 1996 .

[16]  Paolo Toth,et al.  Knapsack Problems: Algorithms and Computer Implementations , 1990 .

[17]  Mahmoud H. Alrefaei,et al.  Discrete stochastic optimization using variants of the stochastic ruler method , 2005 .

[18]  M. Dufwenberg.  Game theory. , 2011, Wiley interdisciplinary reviews. Cognitive science.

[19]  Daniel P. Heyman,et al.  Stochastic models in operations research , 1982 .

[20]  Andrew Wallace.  Sequential resource allocation utilizing agents , 2003 .

[21]  I. Sabuncuoglu,et al.  Stochastic assembly line balancing using beam search , 2005 .

[22]  S. Brams,et al.  Prisoners' Dilemma and Professional Sports Drafts , 1979 .

[23]  Gregory Dobson,et al.  Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data , 1982, Math. Oper. Res..

[24]  Steven J. Brams,et al.  Mathematics and democracy: Designing better voting and fair-division procedures , 2008, Math. Comput. Model..

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

[26]  Arnaud Fréville,et al.  The multidimensional 0-1 knapsack problem: An overview , 2004, Eur. J. Oper. Res..

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

[28]  Jeffrey W. Ohlmann,et al.  A Player Selection Heuristic for a Sports League Draft , 2007 .

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

[30]  David Pisinger,et al.  Budgeting with bounded multiple-choice constraints , 2001, Eur. J. Oper. Res..

[31]  Mahmoud H. Alrefaei,et al.  A modification of the stochastic ruler method for discrete stochastic optimization , 2001, Eur. J. Oper. Res..