18 citations · 109 across the 28 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 6 cited
Computing exact minimum cuts without knowing the graph
Aviad Rubinstein, Tselil Schramm, S. Matthew Weinberg
We give query-efficient algorithms for the global min-cut and the s-t cut problem in unweighted, undirected graphs. Our oracle model is inspired by the submodular function minimiza…
cs.GT2017
Multi-armed Bandit Problems with Strategic Arms
Mark Braverman, Jieming Mao, Jon Schneider +1
We study a strategic version of the multi-armed bandit problem, where each arm is an individual strategic agent and we, the principal, pull one arm each round. When pulled, the arm…