Zobrazeno 1 - 10
of 10 260
pro vyhledávání: '"Contention resolution"'
Contention resolution addresses the problem of coordinating access to a shared communication channel. Time is discretized into synchronized slots, and a packet can be sent in any slot. If no packet is sent, then the slot is empty; if a single packet
Externí odkaz:
http://arxiv.org/abs/2408.11275
Autor:
Wang, Dingyu
\emph{Contention Resolution} is a fundamental symmetry-breaking problem in which $n$ devices must acquire temporary and exclusive access to some \emph{shared resource}, without the assistance of a mediating authority. For example, the $n$ devices may
Externí odkaz:
http://arxiv.org/abs/2407.08845
Publikováno v:
In EC 2024
We study the performance of sequential contention resolution and matching algorithms on random graphs with vanishing edge probabilities. When the edges of the graph are processed in an adversarially-chosen order, we derive a new OCRS that is $0.382$-
Externí odkaz:
http://arxiv.org/abs/2406.14506
We study online contention resolution schemes (OCRSs) and prophet inequalities for non-product distributions. Specifically, when the active set is sampled according to a pairwise-independent (PI) distribution, we show a $(1-o_k(1))$-selectable OCRS f
Externí odkaz:
http://arxiv.org/abs/2406.15876
We study multi-buyer multi-item sequential item pricing mechanisms for revenue maximization with the goal of approximating a natural fractional relaxation -- the ex ante optimal revenue. We assume that buyers' values are subadditive but make no assum
Externí odkaz:
http://arxiv.org/abs/2404.14679
Autor:
Sergeev, Ivan
The contention resolution framework is a versatile rounding technique used as a part of the relaxation and rounding approach for solving constrained submodular function maximization problems. We apply this framework to the hypergraph matching, knapsa
Externí odkaz:
http://arxiv.org/abs/2404.00041
Contention resolution addresses the challenge of coordinating access by multiple processes to a shared resource such as memory, disk storage, or a communication channel. Originally spurred by challenges in database systems and bus networks, contentio
Externí odkaz:
http://arxiv.org/abs/2403.03876
In the Network Revenue Management (NRM) problem, products composed of up to L resources are sold to stochastically arriving customers. We take a randomized rounding approach to NRM, motivated by the modern tool of Online Contention Resolution Schemes
Externí odkaz:
http://arxiv.org/abs/2403.05378
Autor:
MacRury, Calum, Ma, Will
We introduce a new approach for designing Random-order Contention Resolution Schemes (RCRS) via exact solution in continuous time. Given a function $c(y):[0,1] \rightarrow [0,1]$, we show how to select each element which arrives at time $y \in [0,1]$
Externí odkaz:
http://arxiv.org/abs/2310.10101
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.