Algorithms
Learning and Efficiency of Outcomes in Games
Selfish behavior can often lead to a suboptimal outcome for all participants, a phenomenon illustrated by many classical examples in game theory. Over the last decade, we developed a good understanding of how to quantify…
Dynamic Matching in School Choice: Efficient Seat Reassignment after Late Cancellations
As market design theory increasingly shapes the design and operations of real-life marketplaces, it is important for designers to provide simple policy levers that practitioners can use to optimize platform objectives. In the school choice…
Automated Economic Reasoning with Quantifier Elimination
Many theorems in economics can be proven (and hypotheses shown to be false) with available decision algorithms. This paper assembles a few dozen classic examples from economic theory that demonstrate why CAD-based algorithms are practical,…
A Unifying Theory of First-Order Methods and Applications
First-order methods in optimization have become the workhorse tool in modern data-driven applications. Although various general methods with optimal iteration complexities have been known for decades, their standard analysis often appears unintuitive. In this talk,…
