Sampling Individually-Fair Rankings that are Always Group Fair
Open Access
- 8 August 2023
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 205-216
Abstract
No abstract availableAll Related Versions
Funding Information
- NSF (National Science Foundation) (CCF-2112665,IIS-204595)
This publication has 37 references indexed in Scilit:
- The search engine manipulation effect (SEME) and its possible impact on the outcomes of electionsProceedings of the National Academy of Sciences, 2015
- Learning to Rank for Information RetrievalFoundations and Trends® in Information Retrieval, 2009
- Random sampling from a search engine's indexJournal of the ACM, 2008
- Incremental cluster-based retrieval using compressed cluster-skipping inverted filesACM Transactions on Information Systems, 2008
- Learning to rank using gradient descent2005
- Scaling personalized web search2003
- Cumulated gain-based evaluation of IR techniquesACM Transactions on Information Systems, 2002
- Authoritative sources in a hyperlinked environmentJournal of the ACM, 1999
- Multiple Jeopardy, Multiple Consciousness: The Context of a Black Feminist IdeologySigns: Journal of Women in Culture and Society, 1988
- Notes on the Birkhoff Algorithm for Doubly Stochastic MatricesCanadian Mathematical Bulletin, 1982