Below event would be a screening of a past talk by Henry Yuen (available on YouTube) with the same title.

The theory of Fair Division addresses the fundamental problem of allocating goods among agents with equal entitlements but distinct preferences.

The fact that the polynomial (x1+...+xn)^d can be written as a poly(n,d)-sum of products of univariates is a consequence of what is popularly known as 'the duality trick' in the algebraic complexity circles.

The problem of chasing convex functions is easy to state: faced with a sequence of convex functions {f_t}, the goal of the algorithm is to output a point x_t at each time, so that the sum of the function costs f_t(x_t), plus the movement costs ||