Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Ranking with Fairness Constraints

From MaRDI portal
Publication:5002698
Jump to:navigation, search

DOI10.4230/LIPIcs.ICALP.2018.28zbMath1499.68399arXiv1704.06840OpenAlexW2963919086MaRDI QIDQ5002698

L. Elisa Celis, Nisheeth K. Vishnoi, Damian Straszak

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1704.06840

zbMATH Keywords

optimizationfairnessrankingmatchingapproximation algorithms


Mathematics Subject Classification ID

Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Approximation algorithms (68W25)


Related Items

Removing algorithmic discrimination (with minimal individual error), Collective schedules: axioms and algorithms, Unnamed Item



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • New approaches to multi-objective optimization
  • Fairness through awareness
  • Universal Factor Graphs
  • Exposure to ideologically diverse news and opinion on Facebook
  • Introduction to Information Retrieval
  • On the Complexity of Constrained Determinantal Point Processes
  • Greedy in Approximation Algorithms
  • A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5002698&oldid=19458127"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 8 February 2024, at 11:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki