Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The ZERO Regrets Algorithm: Optimizing over Pure Nash Equilibria via
  Integer Programming   Designing efficient algorithms to compute Nash equilibria poses considerable
challenges in Algorithmic Game Theory (AGT). We shed new light on the
intersection between Algorithmic Game Theory and Integer Programming. We
introduce ZERO Regrets, a general and efficient cutting plane algorithm to
compute, enumerate, and select Pure Nash Equilibria (PNEs) in Integer
Programming Games, a class of simultaneous and non-cooperative games. We
present a theoretical foundation for our algorithmic reasoning and provide a
polyhedral characterization of the convex hull of the Pure Nash Equilibria. We
introduce the concept of equilibrium inequality, and devise an equilibrium
separation oracle to separate non-equilibrium strategies from PNEs. We evaluate
our algorithmic framework on a wide range of problems from the literature and
provide a solid benchmark against the existing algorithmic approaches.

3
The categories of this paper are: physics
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
15
The categories of this paper are: nucl-ex
25
The categories of this paper are: patt-sol
12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
30
The categories of this paper are: q-alg
24
The categories of this paper are: dg-ga
8
The categories of this paper are: hep-ex
32
The categories of this paper are: atom-ph
31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin