Skip to main content

Approximation Algorithms for k-Submodular Maximization Under the Fair Constraints and Size Constraints

  • Conference paper
  • First Online:
Algorithmic Aspects in Information and Management (AAIM 2024)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 15179))

  • 288 Accesses

Abstract

Submodular function maximization, a crucial aspect of combinatorial optimization, is extensively applied in various fields like economics and computing. Recently, the focus has shifted towards the generalizations of submodular maximization problems, such as k-submodular function maximization. This approach not only considers the selection of elements from the ground set but also the specific k-set they belong to. It has been proved useful in modeling several machine learning problems, including influence maximization with k topics and sensor placement with k types of sensors. In real-world applications, elements possess certain attributes like gender, age, race, etc., which are used to group elements in the ground set. To maintain fairness, it is desirable to have a balanced number of elements in each group, introducing the concept of group fairness. We divide the ground set V into m groups \(\left( V_{1},V_{2},...,V_{m} \right) \), each representing items with the same attribute. If the difference in the number of elements between any two groups is less than or equal to \(\alpha \), we say the group fairness constraints are satisfied. Existing k-submodular algorithms do not account for the group fairness constraints, leading to imbalances in group sizes. This paper addresses this gap by studying k-submodular maximization under the fairness constraints. We explore the k-submodular maximization problem under the intersection of the fairness constraints and total size constraint, achieving an approximate ratio of 1/2 for monotone cases and 1/24 for non-monotone cases.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bronfenbrenner, M.: Equality and equity. Ann. Am. Acad. Pol. Soc. Sci. 409(1), 9–23 (1973)

    Article  Google Scholar 

  2. Celis, L.E., Huang, L., Vishnoi, N.K.: Multiwinner voting with fairness constraints. In: Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. pp. 144–151. IJCAI press, Stockholm, Sweden (2018)

    Google Scholar 

  3. Celis, L.E., Keswani, V., Straszak, D., Deshpande, A., Kathuria, T., Vishnoi, N.K.: Fair and diverse dpp-based data summarization. In: Proceedings of the 35th International Conference on Machine Learning. vol. 80, pp. 715–724. PMLR press, Stockholm, Sweden (2018)

    Google Scholar 

  4. Dueck, D., Frey, B.J.: Non-metric affinity propagation for unsupervised image categorization. In: proceedings of the 11th International Conference on Computer Vision. pp. 1–8. IEEE Computer Society press, Rio de Janeiro, Brazil (2007)

    Google Scholar 

  5. Halabi, M.E., Fusco, F., Norouzi-Fard, A., Tardos, J., Tarnawski, J.: Fairness in streaming submodular maximization over a matroid constraint. In: Proceedings of the 15th International Conference on Machine Learning. vol. 202, pp. 9150–9171. PMLR press, Honolulu, Hawaii, USA (2023)

    Google Scholar 

  6. Halabi, M.E., Mitrovic, S., Norouzi-Fard, A., Tardos, J., Tarnawski, J.: Fairness in streaming submodular maximization: Algorithms and hardness. Advances in Neural Information Processing Systems abs/2010.07431 (2020)

    Google Scholar 

  7. Huber, A., Kolmogorov, V.: Towards minimizing k-submodular functions. In: Proceedings of the 2nd International Symposium on Combinatorial Optimization. vol. 7422, pp. 451–462. Springer press, Athens, Greece (2012). https://doi.org/10.1007/978-3-642-32147-4_40

  8. Iwata, S., Tanigawa, S., Yoshida, Y.: Improved approximation algorithms for k-submodular function maximization. In: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 404–413. SIAM press, Arlington, VA, USA (2016)

    Google Scholar 

  9. Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. Theoretical Computer Science pp. 105–147 (2015)

    Google Scholar 

  10. Lin, H., Bilmes, J.: A class of submodular functions for document summarization. In: Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies. pp. 510–520. The Association for Computer Linguistics press, Portland, Oregon, USA (2011)

    Google Scholar 

  11. Nemhauser, G.L., Wolsey, L.A.: Best algorithms for approximating the maximum of a submodular set function. Mathematical Methods of Operations Research pp. 177–188 (1978)

    Google Scholar 

  12. Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming pp. 265–294 (1978)

    Google Scholar 

  13. Niu, S., Liu, Q., Zhou, Y., Li, M.: Fast algorithms for k-submodular maximization subject to a matroid constraint. CoRR abs/2307.13996 (2023)

    Google Scholar 

  14. Ohsaka, N., Yoshida, Y.: Monotone k-submodular function maximization with size constraints. Advances in Neural Information Processing Systems 28 (2015)

    Google Scholar 

  15. Rafiey, A., Yoshida, Y.: Fast and private submodular and k-submodular functions maximization with matroid constraints. In: Proceedings of the 37th International Conference on Machine Learning. pp. 7887–7897. PMLR press, Virtual Event (2020)

    Google Scholar 

  16. Sakaue, S.: On maximizing a monotone k-submodular function subject to a matroid constraint. Discret. Optim. 23, 105–113 (2017)

    Article  MathSciNet  Google Scholar 

  17. Singh, A.P., Guillory, A., Bilmes, J.A.: On bisubmodular maximization. In: Proceedings of the 15th International Conference on Artificial Intelligence and Statistics. vol. 22, pp. 1055–1063. JMLR press, La Palma, Canary Islands, Spain (2012)

    Google Scholar 

  18. Sun, Y., Liu, Y., Li, M.: Maximization of k-submodular function with a matroid constraint. In: Proceedings of the Theory and Applications of Models of Computation - 17th Annual Conference. vol. 13571, pp. 1–10. Springer press, Tianjin, China (2022). https://doi.org/10.1007/978-3-031-20350-3_1

  19. Tang, S., Yuan, J.: Group equality in adaptive submodular maximization. INFORMS Journal on Computing (2023)

    Google Scholar 

  20. Tang, S., Yuan, J., Mensah-Boateng, T.: Achieving long-term fairness in submodular maximization through randomization pp. 161–173 (2023)

    Google Scholar 

  21. Wang, Y., Fabbri, F., Mathioudakis, M.: Fair and representative subset selection from data streams. In: Proceedings of the 30th Web Conference 2021. pp. 1340–1350. ACM press, Ljubljana, Slovenia (2021)

    Google Scholar 

  22. Ward, J., Zivný, S.: Maximizing bisubmodular and k-submodular functions. In: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 1468–1481. SIAM press, Portland, Oregon, USA (2014)

    Google Scholar 

  23. Ward, J., Živnỳ, S.: Maximizing k-submodular functions and beyond. ACM Trans. Algorithms 12(4), 1–26 (2016)

    Article  MathSciNet  Google Scholar 

  24. Xiao, H., Liu, Q., Zhou, Y., Li, M.: Approximation algorithms for k-submodular maximization subject to a knapsack constraint. CoRR arXiv: abs/2306.14520 (2023)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Bin Liu .

Editor information

Editors and Affiliations

Ethics declarations

Disclosure of Interests

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Hu, W., Liu, B. (2024). Approximation Algorithms for k-Submodular Maximization Under the Fair Constraints and Size Constraints. In: Ghosh, S., Zhang, Z. (eds) Algorithmic Aspects in Information and Management. AAIM 2024. Lecture Notes in Computer Science, vol 15179. Springer, Singapore. https://doi.org/10.1007/978-981-97-7798-3_20

Download citation

  • DOI: https://doi.org/10.1007/978-981-97-7798-3_20

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-97-7797-6

  • Online ISBN: 978-981-97-7798-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics