Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and
  Structural Properties   The solution to a Nash or a nonsymmetric bargaining game is obtained by
maximizing a concave function over a convex set, i.e., it is the solution to a
convex program. We show that each 2-player game whose convex program has linear
constraints, admits a rational solution and such a solution can be found in
polynomial time using only an LP solver. If in addition, the game is succinct,
i.e., the coefficients in its convex program are ``small'', then its solution
can be found in strongly polynomial time. We also give a non-succinct linear
game whose solution can be found in strongly polynomial time.

2
The categories of this paper are: math
32
The categories of this paper are: atom-ph
4
The categories of this paper are: cond-mat
14
The categories of this paper are: math-ph
24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
8
The categories of this paper are: hep-ex
25
The categories of this paper are: patt-sol
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
13
The categories of this paper are: quant-ph
30
The categories of this paper are: q-alg
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom