Online Algorithms for Warehouse Management
An algorithmic view of how best to organize stock in an automated warehouse without prior knowledge of the popularity (and thus, request frequency) of items ...
An algorithmic view of how best to organize stock in an automated warehouse without prior knowledge of the popularity (and thus, request frequency) of items ...
An invited journal submission of our WADS conference paper, further detailing our analysis of the Modular Circulation problem.
An introduction to and analysis of the Modular Circulation problem, a circulation problem in which all demands are an integer modulo some value lambda.
A study of the computational complexity of a variant of the popular 2048 game in which no new tiles are generated after each move.
An introduction to and analysis of the Traffic Crossing Problem, in which a set of autonomous vehicles must cross an intersection collision-free while adheri...
A study on the complexity of a slightly adapted version of the game 2048 showing that a number of natural decision problems turn out to be NP-Complete.
A continuation of our ITD analysis, with an emphasis on comparing various “greedy” strategies to “risk-averse” ones as well as the effects of tweaking key p...
A continued analysis of groups of closely related strategies competing in the Iterated Traveler’s Dilemma and how their performance together compares with th...
An analysis of the relative performances of groups of closely related strategies competing in the Iterated Traveler’s Dilemma and how they perform when each ...
A comparison of past experimental results on the ITD and the effects on strategy performance of altering the payoff matrix.
A further study of the Iterated Traveler’s Dilemma, with some tweaks and additions to strategies in the tournament.
An experimental study of an interesting 2-player game known as the Iterated Traveler’s Dilemma.