We introduce a general technique for proving membership of search problems with exact
rational solutions in PPAD, one of the most well-known classes containing total search …

We propose efficient no-regret learning dynamics and ellipsoid-based methods for
computing linear correlated equilibria $\unicode {x2014} $ a relaxation of correlated …

We study the classic problem of dividing a collection of indivisible resources in a fair and
efficient manner among a set of agents having varied preferences. Pareto optimality is a …

We investigate the role of constraints in the computational complexity of min-max
optimization. First, we show that when the constraints are jointly convex (ie, the min player …

Quasi-variational Inequalities (QVI) are a class of mathematical problems that are a
generalization of variational inequalities. Variational inequalities and quasi-variational …

We investigate efficient ways for the incorporation of liquid democracy into election settings
in which voters submit cumulative ballots, ie, when each voter is assigned a virtual coin that …

This thesis studies dynamic flows comprised of infinitesimally small agents (= flow particles)
travelling through a network while continuously adapting their choice of route based on the …

Fair division of resources emerges in a variety of different contexts in real-world problems,
some of which can be seen through the lens of game theory. Many equilibrium notions for …

Computational aspects of solution notions such as Nash equilibrium have been extensively
studied, including settings where the ultimate goal is to find an equilibrium that possesses …

In this thesis, we study the computational complexity of various total search problems. A
search problem being total means that for any instance of the problem a solution is …