Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Improved Approximation Guarantee for the Maximum Budgeted Allocation
  Problem   We study the Maximum Budgeted Allocation problem, which is the problem of
assigning indivisible items to players with budget constraints. In its most
general form, an instance of the MBA problem might include many different
prices for the same item among different players, and different budget
constraints for every player. So far, the best approximation algorithms we know
for the MBA problem achieve a $3/4$-approximation ratio, and employ a natural
LP relaxation, called the Assignment-LP. In this paper, we give an algorithm
for MBA, and prove that it achieves a $3/4+c$-approximation ratio, for some
constant $c>0$. This algorithm works by rounding solutions to an LP called the
Configuration-LP, therefore also showing that the Configuration-LP is strictly
stronger than the Assignment-LP (for which we know that the integrality gap is
$3/4$) for the MBA problem.

15
The categories of this paper are: nucl-ex
19
The categories of this paper are: eess
18
The categories of this paper are: econ
12
The categories of this paper are: nucl-th
7
The categories of this paper are: hep-th
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
20
The categories of this paper are: acc-phys
22
The categories of this paper are: chao-dyn
13
The categories of this paper are: quant-ph
9
The categories of this paper are: nlin
24
The categories of this paper are: dg-ga
6
The categories of this paper are: astro-ph
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
27
The categories of this paper are: comp-gas