Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Ganz, Amit"'
In this paper we consider the online Submodular Welfare (SW) problem. In this problem we are given $n$ bidders each equipped with a general (not necessarily monotone) submodular utility and $m$ items that arrive online. The goal is to assign each ite
Externí odkaz:
http://arxiv.org/abs/2308.07746
Autor:
LINDER‐GANZ, ERAN1 (AUTHOR), GEFEN, AMIT1 (AUTHOR), ELAD, DAVID1 (AUTHOR), CHEN, JUZA2 (AUTHOR)
Publikováno v:
Annals of the New York Academy of Sciences. 2007, Vol. 1101, p464-476. 13p. 6 Diagrams, 1 Chart.
