Optimizing Google by solving allocation problems

Pawel Lichocki

The optimal allocation of resources is crucial for an efficient operation of computer systems. In practice, the definition of optimality is unclear and depends on the application. In the talk, we focus on two helpful concepts: 1) max-min fair allocation and 2) balanced allocation. We explain how to compute these allocations using a water-filling algorithm and mixed-integer programming. Along the way, we tell a bit how the work gets done at Google and describe our hybrid approach to research.

The talk and slides will be in English.