Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting

arXiv (Cornell University)(2023)10.1145/3580305.3599467Source: DataRank Database

Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting is a research paper published in arXiv (Cornell University) (2023). On theSindex it has a DataRank of 0. It has been cited 1 time.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access1 citations

Free full text

Cite:

Linked data & code

Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting · arXiv

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (11 grants)Impact (FWCI 0.50)OA: goldTopics (33)Linked Datasets (1)DataCite Reuse (1)IDs (PubMed, OpenAlex)SDGs (1)

FAIR Checklist

Context only (not used in score)

Findable (2/2)

Has DOI
Indexed in repositories

Accessible (1/2)

Open Access

Interoperable (2/2)

DataCite relations
Linked datasets

Reusable (0/3)

FAIR checklist signals are shown for context only and do not affect DataRank scoring.

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

Authors (4)

Aviva Prins ORCID,Aravind Srinivasan ORCID,John P. Dickerson ORCID,Christine Herlihy ORCID

Live enrichment

PubMed:21097893 OpenAlex:https://openalex.org/W3170121757

National Science Foundation

Grant: CAREER Award IIS-1846237, D-ISN Award #2039862, CCF-1852352, CCF-1749864, CCF-1918749

DOD U.S. Department of Defense

Grant: WHS Award #HQ003420F0035

Google

Grant: Faculty Research Award

National Institute of Standards and Technology

Grant: Professional Research Experience Program (PREP), MSE Award #20126334

National Institutes of Health

Grant: R01 Award NLM-013039-01

Defense Advanced Research Projects Agency

Grant: GARD #HR00112020007

National Science Foundation

Grant: 1846237

CAREER: Scalable and Robust Dynamic Matching Market Design

National Science Foundation

Grant: 1749864

EAGER: Probabilistic Models and Algorithms

National Science Foundation

Grant: 2039862

D-ISN: TRACK 1: Collaborative Research: Discovery, Analysis, and Disruption of Illicit Narcotic Supply Networks

National Science Foundation

Grant: 1918749

Expeditions: Collaborative Research: Global Pervasive Computational Epidemiology

National Science Foundation

Grant: 1852352

REU Site: CAAR: Combinatorics and Algorithms Applied to Real Problems

FWCI

0.50

Citation Percentile

0.5%

Citation Trend

2024

goldLicense: cc-by

https://dl.acm.org/doi/pdf/10.1145/3580305.3599467

GOLDhttps://dl.acm.org/doi/pdf/10.1145/3580305.3599467

https://dl.acm.org/doi/pdf/10.1145/3580305.3599467

publisherhttps://dl.acm.org/doi/10.1145/3580305.3599467

http://dx.doi.org/10.1145/3580305.3599467

Fields of Study

Advanced Bandit Algorithms ResearchHealthcare Operations and Scheduling OptimizationMobile Crowdsensing and CrowdsourcingComputer Science03 medical and health sciences0302 clinical medicine0211 other engineering and technologies02 engineering and technology0101 mathematics01 natural sciences

Keywords

Probabilistic logicMathematical optimizationComputer scienceConstraint (computer-aided design)Psychological interventionRationingResource allocationMathematical economicsBudget constraintOperations researchEconomicsMathematicsMicroeconomicsMedicineArtificial intelligenceHealth careFOS: Computer and information sciencesComputer Science - Machine LearningComputer Science - Computers and SocietyArtificial Intelligence (cs.AI)Computer Science - Artificial IntelligenceComputers and Society (cs.CY)Machine Learning (cs.LG)

Sustainable Development Goals

SDG 0: Partnerships for the goals

Planning to Fairly Allocate: Probabilistic Fairness in the Restless Bandit Setting

10.48550/arxiv.2106.07677arXiv