FIXP-membership via Convex Optimization: Games, Cakes, and Markets

by   Aris Filos-Ratsikas, et al.

We introduce a new technique for proving membership of problems in FIXP - the class capturing the complexity of computing a fixed-point of an algebraic circuit. Our technique constructs a "pseudogate" which can be used as a black box when building FIXP circuits. This pseudogate, which we term the "OPT-gate", can solve most convex optimization problems. Using the OPT-gate, we prove new FIXP-membership results, and we generalize and simplify several known results from the literature on fair division, game theory and competitive markets. In particular, we prove complexity results for two classic problems: computing a market equilibrium in the Arrow-Debreu model with general concave utilities is in FIXP, and computing an envy-free division of a cake with general valuations is FIXP-complete. We further showcase the wide applicability of our technique, by using it to obtain simplified proofs and extensions of known FIXP-membership results for equilibrium computation for various types of strategic games, as well as the pseudomarket mechanism of Hylland and Zeckhauser.



page 1

page 2

page 3

page 4


Convex-Concave Min-Max Stackelberg Games

Min-max optimization problems (i.e., min-max games) have been attracting...

Infinite-Dimensional Fisher Markets and Tractable Fair Division

Linear Fisher markets are a fundamental economic model with applications...

Quantum algorithms and lower bounds for convex optimization

While recent work suggests that quantum computers can speed up the solut...

Competitive Allocation of a Mixed Manna

We study the fair division problem of allocating a mixed manna under add...

First-order methods for large-scale market equilibrium computation

Market equilibrium is a solution concept with many applications such as ...

Tarski's Theorem, Supermodular Games, and the Complexity of Equilibria

The use of monotonicity and Tarski's theorem in existence proofs of equi...

What is in #P and what is not?

For several classical nonnegative integer functions, we investigate if t...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.