Herlihy, Christine, Prins, Aviva, Srinivasan, Aravind, and Dickerson, John. Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. Retrieved from https://par.nsf.gov/biblio/10497765. Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD) . Web. doi:10.1145/3580305.3599467.

Herlihy, Christine, Prins, Aviva, Srinivasan, Aravind, & Dickerson, John. Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting. Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD), (). Retrieved from https://par.nsf.gov/biblio/10497765. https://doi.org/10.1145/3580305.3599467

Herlihy, Christine, Prins, Aviva, Srinivasan, Aravind, and Dickerson, John. "Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting". Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD) (). Country unknown/Code not available: Association for Computing Machinery (ACM). https://doi.org/10.1145/3580305.3599467. https://par.nsf.gov/biblio/10497765.

@article{osti_10497765,
place = {Country unknown/Code not available}, title = {Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting}, url = {https://par.nsf.gov/biblio/10497765}, DOI = {10.1145/3580305.3599467}, abstractNote = {}, journal = {Proc. ACM Conference on Knowledge Discovery and Data Mining (KDD)}, publisher = {Association for Computing Machinery (ACM)}, author = {Herlihy, Christine and Prins, Aviva and Srinivasan, Aravind and Dickerson, John}, }