We study the complexity of computing stationary Nash equilibrium (NE) in n-player infinite-
horizon general-sum stochastic games. We focus on the problem of computing NE in such …

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 …

In 1979, Hylland and Zeckhauser\cite {hylland} gave a simple and general scheme for
implementing a one-sided matching market using the power of a pricing mechanism. Their …

Kakutani's Fixed Point theorem is a fundamental theorem in topology with numerous
applications in game theory and economics. Computational formulations of Kakutani exist …

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 …

Financial networks model debt obligations between economic firms. Computational and
game-theoretic analyses of these networks have been recent focus of the literature. The …

We consider the setting of repeated fair division between two players, denoted Alice and
Bob, with private valuations over a cake. In each round, a new cake arrives, which is …

Financial networks model a set of financial institutions (firms) interconnected by obligations.
Recent work has introduced to this model a class of obligations called credit default swaps …

We consider the query complexity of cake cutting in the standard query model and give
lower and upper bounds for computing approximately envy-free, perfect, and equitable …

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 …