Achieving long-term fairness in submodular maximization through randomization

DOI10.1007/978-3-031-46826-1_13MaRDI QIDQ6899196zbMATH OpenFDO

Authors Shaojie Tang, Jing Yuan, Twumasi Mensah-Boateng

Publication date 17 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-46826-1_13

Mathematics Subject Classification ID

Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An analysis of approximations for maximizing submodular set functions—I
• Beyond pointwise submodularity: non-monotone adaptive submodular maximization in linear time
• Beyond pointwise submodularity: non-monotone adaptive submodular maximization subject to knapsack and \(k\)-system constraints
• Convex optimization: algorithms and complexity
• Correlation robust stochastic optimization
• Fairness through awareness
• Group fairness in non-monotone submodular maximization
• scientific article; zbMATH DE number 5485514 (Why is no real title available?)
• Influence maximization with partial feedback
• Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)
• Optimal approximation for submodular and supermodular optimization with bounded curvature
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(2)

• Minimum power partial cover with fairness constraint
• Approximation algorithms for k-submodular maximization under fairness constraints and size constraints

This page was built for publication: Achieving long-term fairness in submodular maximization through randomization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899196)