Maintaining a maximum bipartite matching online while minimizing
recours...
We show that the max entropy algorithm can be derandomized (with respect...
A matroid ℳ on a set E of elements has the α-partition
property, for som...
We give a randomized 1+√(8ln k/k)-approximation algorithm for
the minimu...
We investigate non-adaptive algorithms for matroid prophet inequalities....
We build upon recent work [Kleinberg and Oren, 2014, Kleinberg et al., 2...
For some ϵ > 10^-36 we give a 3/2-ϵ approximation
algorithm for metric T...
We study combinatorial auctions with interdependent valuations. In such
...
Stable matching is a classical combinatorial problem that has been the
s...