Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Mcadry, Aleksander"'
We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of $m$ indivisible goods to $n$ players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have a
Externí odkaz:
http://arxiv.org/abs/1403.7519
