Previous Conferences & Workshops

In combinatorial allocation, m items are to be assigned to n players so that their total utility is maximized. This problem has many variants depending on the utility functions involved and possible additional constraints. We consider two variants...

In 1991, Witten proposed a famous conjecture (solved by Kontsevich) related the intersection theory of Deligne-Mumford moduli space to KDV-integrable hierearchy. To generalize his conjecture, Witten proposed a remarkable PDE based any...

This is continuation of the previous seminar in which the formulation of the renormalisation group is given in more detail: a space of statistical mechanical models is defined. The renormalisation group is a map on this space and there is a basic...

We consider the problem of bounding the absolute value of the correlation between parity and low-degree polynomials modulo q, for odd q >= 3. The boolean function corresponding to the polynomial is 0 on an input iff the polynomial evaluates to 0...

A very long random walk, seen from so far away that individual steps cannot be resolved, is the continuous random path called Brownian motion. This is a rough statement of Donsker's theorem and it is an example of how models in statistical mechanics...

Achieving correlated equilibrium is a problem at the intersection of game theory, cryptography and efficient algorithms. Thus far, however, perfectly rational solutions have been lacking, and the problem has been formulated with somewhat limited...