Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Combinatorial Sleeping Bandits With Fairness Constraints

12 references·1 citing·33 second hop

FromToDepth

this work references cited by second hop

References

2002Finite-time Analysis of the Multiarmed Bandit Problem5,980 cited
2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,410 cited
2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems1,275 cited
2011Multi‐Armed Bandit Allocation Indices685 cited
2012Combinatorial Network Optimization With Unknown Variables: Multi-Armed Bandits With Linear Rewards and Individual Observations413 cited
2013Combinatorial Multi-Armed Bandit: General Framework and Applications392 cited
1987Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewards358 cited
2010Regret bounds for sleeping experts and bandits200 cited
2016Fairness in Learning: Classic and Contextual Bandits199 cited
2018Bandits with Knapsacks137 cited
2015Combinatorial Bandits Revisited124 cited
2016Fairness in learning: classic and contextual bandits95 cited

Cited by

2020Achieving Fairness in the Stochastic Multi-Armed Bandit Problem60 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work