Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Rounding Dynamic Matchings Against an Adaptive Adversary   We present a new dynamic matching sparsification scheme. From this scheme we
derive a framework for dynamically rounding fractional matchings against
\emph{adaptive adversaries}. Plugging in known dynamic fractional matching
algorithms into our framework, we obtain numerous randomized dynamic matching
algorithms which work against adaptive adversaries (the first such algorithms,
as all previous randomized algorithms for this problem assumed an
\emph{oblivious} adversary). In particular, for any constant $\epsilon>0$, our
framework yields $(2+\epsilon)$-approximate algorithms with constant update
time or polylog worst-case update time, as well as $(2-\delta)$-approximate
algorithms in bipartite graphs with arbitrarily-small polynomial update time,
with all these algorithms' guarantees holding against adaptive adversaries. All
these results achieve \emph{polynomially} better update time to approximation
tradeoffs than previously known to be achievable against adaptive adversaries.

5
The categories of this paper are: gr-qc
35
The categories of this paper are: mtrl-th
19
The categories of this paper are: eess
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
3
The categories of this paper are: physics
23
The categories of this paper are: solv-int
28
The categories of this paper are: alg-geom
16
The categories of this paper are: stat
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga
14
The categories of this paper are: math-ph
30
The categories of this paper are: q-alg
11
The categories of this paper are: hep-lat
10
The categories of this paper are: q-bio
29
The categories of this paper are: funct-an