Achieving long-term fairness in submodular maximization through randomization
From MaRDI portal
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
(4)- Minimum power partial cover with fairness constraint
- Approximation algorithms for k-submodular maximization under fairness constraints and size constraints
- Approximation algorithms for k-submodular maximization under the fair constraints and size constraints
- Minimum power partial cover meets fairness: improved approximation guarantees
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)
