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 …

Since the celebrated PPAD-completeness result for Nash equilibria in bimatrix games, a
long line of research has focused on polynomial-time algorithms that compute ε-approximate …

We prove that computing a Nash equilibrium of a two-player (n× n) game with payoffs in [-1,
1] is PPAD-hard (under randomized reductions) even in the smoothed analysis setting …

Since the seminal PPAD-completeness result for computing a Nash equilibrium even in two-
player games, an important line of research has focused on relaxations achievable in …

A polymatrix game is a multi-player game over n players, where each player chooses a pure
strategy from a list of its own pure strategies. The utility of each player is a sum of payoffs it …

We consider 2-players, 2-values minimization games where the players' costs take on two
values, $ a, b $, $ a< b $. The players play mixed strategies and their costs are evaluated by …

In this thesis we study search and optimization problems from computational economics with
primarily stochastic inputs. The results are grouped into two categories: First, we address the …

Abstract" We study the problem of allocating indivisible goods to agents in a fair and efficient
manner. We consider different notions of fairness such as envy-freeness up to one good …

Abstract We consider 2-player, 2-value cost minimization games where the players' costs
take on two values, a, b, with a< b. The players play mixed strategies and their costs are …