In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …

computing its solution. If shortages arenot allowed, the complexity of the proposed algorithm is order T square. Whenbacklogging … is allowed, the complexity of the proposed algorithm is order T cube. …

, then propose a solution method that relies on value function iteration. Finally, in an example we show how our algorithm …

We examine recent claims that a particular Q-learning algorithm used by competitors 'autonomously' and systematically … detailed analysis of the inner workings of this algorithm reveals that there is no immediate reason for alarm. We set out what … is needed to demonstrate the existence of a colluding price algorithm that does form a threat to competition. …