This program aims to develop algorithms for sequential decision problems under a variety of models of uncertainty, with participants from TCS, machine learning, operations research, stochastic control and economics.

This program will bring together experts from various fields to study networks, from graph limits, to modeling and estimation, to processes on networks. Application areas include epidemics, spread of information and other economic and social processes.

This program will bring together researchers in computational complexity, proof complexity, cryptography, and learning theory to make progress on fundamental problems in those areas using the framework of "meta-complexity" — i.e., complexity of computational tasks that are themselves about complexity.

This extended reunion is for long-term participants in the program Satisfiability: Theory, Practice, and Beyond, held in the spring 2021 semester. It will provide an opportunity to meet old and new friends. Moreover, we hope that it will give everyone a chance to reflect on the progress made during the semester and since, and sketch in which directions the field should go in the future.

This program will study new approaches for analysis of functions over the Boolean hypercube and beyond, with the aim of making progress on fundamental problems in complexity, algorithms, and discrete mathematics.