no code implementations • 8 Feb 2021 • Allan Borodin, Calum MacRury, Akash Rakheja
We introduce a new LP that we prove is a relaxation of an optimal offline probing algorithm (the adaptive benchmark) and which overcomes the limitations of previous LP relaxations.
Discrete Mathematics Data Structures and Algorithms Combinatorics F.2.2; G.2.2
1 code implementation • 16 Jun 2018 • Allan Borodin, Joan Boyar, Kim S. Larsen, Denis Pankratov
We develop a template for constructing a reduction from Pair Matching to other problems in the priority model with advice -- this part is technically challenging since the reduction needs to define a valid priority function for Pair Matching while respecting the priority function for the other problem.
Data Structures and Algorithms
1 code implementation • Advances in Neural Information Processing Systems 16 2004 • Allan Borodin, Ran El-Yaniv, Vincent Gogan
A novel algorithm for actively trading stocks is presented.
