Beyond submodularity: a unified framework of randomized set selection with group fairness constraints (Q6039536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: College admissions with affirmative action / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2809807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Submodular Maximization via a Nonsymmetric Technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Maximization with Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fairness through awareness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revenue Management Under a General Discrete Choice Model of Consumer Behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group fairness in non-monotone submodular maximization / rank
 
Normal rank

Revision as of 01:38, 1 August 2024

scientific article; zbMATH DE number 7682622
Language Label Description Also known as
English
Beyond submodularity: a unified framework of randomized set selection with group fairness constraints
scientific article; zbMATH DE number 7682622

    Statements

    Identifiers