Mar 26, 2024 · We generalize the problem of online submodular welfare maximization to incorporate a variety of new elements arising from reusability, stochastic rewards.
Apr 1, 2024 · We generalize the problem of online submodular welfare maximization to incorporate a variety of new elements arising from reusability, ...
It is shown that, in general, adaptivity to stochastic rewards (and similar features) offers no theoretical (worst-case) benefits.
Online Submodular Welfare Maximization Meets Post-Allocation Stochasticity and Reusability. R Udwani. arXiv preprint arXiv:2403.18059, 2024. 2024 ; Almost Tight ...
Online Submodular Welfare Maximization Meets Post-Allocation Stochasticity and Reusability · Rajan Udwani. Computer Science, Economics. ArXiv. 2024. TLDR. It is ...
Motivated by online ad allocation, we study the problem of simultaneous approximations for the adversarial and stochastic online budgeted allocation problem.
Missing: Reusability. | Show results with:Reusability.
Oct 7, 2024 · Rajan Udwani: Online Submodular Welfare Maximization Meets Post-Allocation Stochasticity and Reusability. CoRR abs/2403.18059 (2024)
In the Submodular Welfare Maximization (SWM) problem, the input consists of a set of n items, each of which must be allocated to one of m agents.
Missing: Post- Stochasticity Reusability.
本論文は、オンラインサブモジュラー厚生最大化問題(OSW)を一般化した新しいモデルを提案している。従来のOSWでは、各リクエストを1つのリソースに割り当てるという ...
Abstract. We prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2- competitive for welfare maximization with ...
Missing: Meets Reusability.