Dear Colleagues,

As Editor-in-Chief of Algorithms, I am pleased to announce the winner of the 2017 Algorithms Travel Award on behalf of the Evaluation Committee:

Aviad Rubinstein, Ph.D. student at the UC Berkeley, whose research focuses on computational complexity. He is planning to present his work “Settling the complexity of computing approximate two-player Nash equilibria” at the Highlights of Algorithms (HALG 2017). The award consists of 800 Swiss Francs towards attending this conference.

It was a difficult decision with such high quality applications for the award and we thank all applicants. We wish to congratulate Mr. Aviad Rubinstein for his accomplishments. 

Henning Fernau,
Editor-in-Chief