Meritocratic Fairness for Infinite and Contextual Bandits
Authors:
Open Access
- 27 December 2018
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 158-163
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Inherent Trade-Offs in Algorithmic Fairness2018
- Algorithmic Decision Making and the Cost of Fairness2017
- Fairness Beyond Disparate Treatment & Disparate Impact2017
- Fairness through awareness2012
- Reinforcement Learning with Immediate Rewards and Linear HypothesesAlgorithmica, 2003
- Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: I.I.D. rewardsIEEE Transactions on Automatic Control, 1987