Beyond submodularity: a unified framework of randomized set selection with group fairness constraints

DOI10.1007/s10878-023-01035-4zbMath1518.90096arXiv2304.06596OpenAlexW4367323655MaRDI QIDQ6039536

Shaojie Tang, Jing Yuan

Publication date: 5 May 2023

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsrandomized algorithmssubmodular maximizationfair subset selection

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Related Items (1)

Group fairness in non-monotone submodular maximization

Cites Work

• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• College admissions with affirmative action
• Group fairness in non-monotone submodular maximization
• Fairness through awareness
• Revenue Management Under a General Discrete Choice Model of Consumer Behavior
• An analysis of approximations for maximizing submodular set functions—I
• Optimal Approximation for Submodular and Supermodular Optimization with Bounded Curvature
• Constrained Submodular Maximization via a Nonsymmetric Technique
• Submodular Maximization with Cardinality Constraints
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)

This page was built for publication: Beyond submodularity: a unified framework of randomized set selection with group fairness constraints