Zobrazeno 1 - 1
of 1
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
