research
∙
11/14/2022
On the Smoothed Complexity of Combinatorial Local Search
We propose a unifying framework for smoothed analysis of combinatorial l...
share
research
∙
10/07/2022
Multi-Agent Systems for Computational Economics and Finance
In this article we survey the main research topics of our group at the U...
research
∙
09/30/2022
Tight Inapproximability for Graphical Games
We provide a complete characterization for the computational complexity ...
research
∙
09/30/2022
Pure-Circuit: Strong Inapproximability for PPAD
The current state-of-the-art methods for showing inapproximability in PP...
research
∙
01/24/2022
Constant Inapproximability for PPA
In the ε-Consensus-Halving problem, we are given n probability measures ...
research
∙
12/28/2020
Square-Cut Pizza Sharing is PPA-complete
We study the computational complexity of computing solutions for the squ...
research
∙
05/24/2020
Walrasian Equilibria in Markets with Small Demands
We study the complexity of finding a Walrasian equilibrium in markets wh...
research
∙
06/06/2019
Connected Subgraph Defense Games
We study a security game over a network played between a defender and k ...
research
∙
03/07/2019
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
We study the problem of finding an exact solution to the consensus halvi...
research
∙
10/10/2018
Strategic Contention Resolution in Multiple Channels
We consider the problem of resolving contention in communication network...
research
∙
10/02/2018
Approximating the Existential Theory of the Reals
The existential theory of the reals (ETR) consists of existentially quan...
research
∙
10/19/2017
