9 citations · 16 across the 8 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.LG2020
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds
Ehsan Emamjomeh-Zadeh, Chen-Yu Wei, Haipeng Luo +1
We revisit the problem of online learning with sleeping experts/bandits: in each time step, only a subset of the actions are available for the algorithm to choose from (and learn a…
cs.GT2020
The Complexity of Interactively Learning a Stable Matching by Trial and Error
Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe
In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to…