The current state-of-the-art methods for showing inapproximability in PPAD arise from the ε-
Generalized-Circuit (ε-GCIRCUIT) problem. Rubinstein (2018) showed that there exists a …

Public goods games in undirected networks are generally known to have pure Nash
equilibria, which are easy to find. In contrast, we prove that, in directed networks, a broad …

We study financial networks and reveal a new kind of systemic risk arising from what we call
default ambiguity—that is, a situation where it is impossible to decide which banks are in …

The current state-of-the-art methods for showing inapproximability in PPAD arise from the ɛ-
Generalized-Circuit (ɛ-GCircuit) problem. Rubinstein (2018) showed that there exists a …

We resolve the computational complexity of two problems known as Necklace Splitting and
Discrete Ham Sandwich, showing that they are PPA-complete. For Necklace Splitting, this …

We show that the computational problem Consensus Halving is PPA-Complete, the first PPA-
Completeness result for a problem whose definition does not involve an explicit circuit. We …

In financial credit networks, prepayments enable a firm to settle its debt obligations ahead of
an agreed-upon due date. Prepayments have a transformative impact on the structure of …

In this paper we will consider a generalized extension of the Eisenberg-Noe model of
financial contagion to allow for time dynamics in both discrete and continuous time …

Polynomial Pigeonhole Principle (PPP) is an important subclass of TFNP with profound
connections to the complexity of the fundamental cryptographic primitives: collision-resistant …

We study the problem of financial assistance (bailouts, stimulus payments, or subsidy
allocations) in a network where individuals experience income shocks. These questions are …