Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: FIXP-membership via Convex Optimization: Games, Cakes, and Markets   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.

12
The categories of this paper are: nucl-th
34
The categories of this paper are: chem-ph
9
The categories of this paper are: nlin
19
The categories of this paper are: eess
15
The categories of this paper are: nucl-ex
37
The categories of this paper are: supr-con
24
The categories of this paper are: dg-ga
0
The categories of this paper are: hep-ph
3
The categories of this paper are: physics
5
The categories of this paper are: gr-qc
7
The categories of this paper are: hep-th
4
The categories of this paper are: cond-mat
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
18
The categories of this paper are: econ
16
The categories of this paper are: stat