Home › Entities › academia › Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness

Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness

Research article (Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval, 2021) · cited 59× · AI/ML
academia openalex:W3155690528
Press Enter · cited answer in seconds

Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness

Summary

Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness is a scholarly article[1].

Key Facts

  • Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness's instance of is recorded as scholarly article[2].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness. Retrieved May 24, 2026, from https://4ort.xyz/entity/computationally-efficient-optimization-of-plackett-luce-ranking-models-for-relevance-and-fairness
MLA “Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/computationally-efficient-optimization-of-plackett-luce-ranking-models-for-relevance-and-fairness.
BibTeX @misc{4ortxyz_computationally-efficient-optimization-of-plackett-luce-ranking-models-for-relevance-and-fairness_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness}}, year = {2026}, url = {https://4ort.xyz/entity/computationally-efficient-optimization-of-plackett-luce-ranking-models-for-relevance-and-fairness}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Computationally Efficient Optimization of Plackett-Luce Ranking Models for Relevance and Fairness — https://4ort.xyz/entity/computationally-efficient-optimization-of-plackett-luce-ranking-models-for-relevance-and-fairness (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/computationally-efficient-optimization-of-plackett-luce-ranking-models-for-relevance-and-fairness · Last refreshed: