under the profile after two distinct histories that agree in the last L periods is equal. Mailath and Morris (2002, 2006) proved that any strict equilibrium in bounded-recall strategies of a game with full support public monitoring is robust to all perturbations of the monitoring structure...

We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose only goal is to outperform the opponent....