The objective of this collaborative textbook is to present the state of ...
We provide a complete characterization for the computational complexity ...
The current state-of-the-art methods for showing inapproximability in PP...
In the ε-Consensus-Halving problem, we are given n probability
measures ...
We study the computational complexity of computing solutions for the
squ...
We study search problems that can be solved by performing Gradient Desce...
Dang et al. have given an algorithm that can find a Tarski fixed point i...
We prove that it is PPAD-hard to compute a Nash equilibrium in a tree
po...
The main result of this paper is that computing the value of a one-clock...
We study the problem of finding an exact solution to the consensus halvi...
This paper studies the complexity of problems in PPAD ∩ PLS that have
un...
The existential theory of the reals (ETR) consists of existentially
quan...
We consider the classic cake-cutting problem of producing envy-free
allo...
Market making is a fundamental trading problem in which an agent provide...
We introduce the problem EndOfPotentialLine and the corresponding comple...
In this paper, we study the problem of deciding the winner of reachabili...