approximate optimality with bounded regret in dynamic matching models
Published Streamed 8 years ago • 341 plays • Length 45:10Download video MP4
Download video MP3
Similar videos
-
1:08:26
constant regret in exchangeable action models: overbooking, bin packing, and beyond
-
49:28
dynamic matching: rounding & sparsification (and new tools)
-
43:52
improved bounds for fully dynamic matching via ordered ruzsa-szemeredi graphs
-
46:00
dynamic regret minimization for bandits without prior knowledge
-
59:45
dynamic spatial matching
-
57:37
the entropy decrement method and the erdos discrepancy problem
-
33:05
obviously strategy-proof mechanisms
-
32:30
robust estimation with tidymodels bootstrap resampling
-
56:51
the variational method of moments
-
1:00:54
matchings
-
50:51
an improved bound for regular partitions of hypergraph of bounded vc_2 dimension
-
33:50
interpolating between stochastic and worst-case optimization
-
33:24
combined approximations for probabilistic query evaluation: an intensional approach
-
1:22:20
optimal no-regret learning in general games via clairvoyant mwu
-
44:07
the state of techniques for solving large imperfect-information games
-
46:24
job matching under constraints
-
40:39
pmse mechanism: differentially private synthetic data with maximal distributional similarity
-
46:58
dynamic algorithms for packing-covering lps via multiplicative weight updates
-
54:28
on the hardness of reinforcement learning with value-function approximation