The entropy method is a beautiful method to show existential results in extremal combinatorics. This blog post will discuss the entropy method through the lens of minimizing combinatorial discrepancy - the playing field where this technique was first introduced.

Google defines a crossword as a grid of squares with blanks into which words crossing vertically and horizontally are written according to clues. This blog post introduces the crosswords problem which is a generalization of this problem from a decision theoretic standpoint.

This blog post discusses the 2017 paper by Bubeck et al on k-server using multiscale entropic regularization.

This blog post discusses Ben Cousins and Santosh Vempala’s 2016 paper on estimation of Volume and Gaussian Volume of a well-rounded convex body.

This blog post discusses some aspects of Online Convex Optimization around Martin Zinkevich’s 2003 paper Online Convex Programming and Generalized Infinitesimal Gradient Ascent.