Previous Conferences & Workshops

Some important mechanisms considered in game theory require solving optimization problems that are computationally hard. Solving these problems approximately may not help, as it may change the players’ rational behavior in the original mechanisms...

This talk is designed for a general mathematical audience; no prior knowledge of type theory is presumed. One of the main goals for the special year on univalent foundations is the development of a logical formalism, called homotopy type theory...

Polynomial Identity Testing (PIT) is the problem of identifying whether a given algebraic circuit computes the identically zero polynomial. It is well-known that this problem can be solved with small error probability by testing whether the circuit...