Balancing Utility and Fairness in Submodular Maximization (Technical Report)

Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation. In many of these problems, the goal is to find a solution that maximizes the average utility over all users, f...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org
Main Authors: Wang, Yanhao, Li, Yuchen, Bonchi, Francesco, Wang, Ying
Format: Paper
Language:English
Published: Ithaca Cornell University Library, arXiv.org 19.06.2023
Subjects:
Algorithms
Data science
Maximization
Optimization
ISSN:2331-8422
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation. In many of these problems, the goal is to find a solution that maximizes the average utility over all users, for each of whom the utility is defined by a monotone submodular function. However, when the population of users is composed of several demographic groups, another critical problem is whether the utility is fairly distributed across different groups. Although the \emph{utility} and \emph{fairness} objectives are both desirable, they might contradict each other, and, to the best of our knowledge, little attention has been paid to optimizing them jointly. To fill this gap, we propose a new problem called \emph{Bicriteria Submodular Maximization} (BSM) to balance utility and fairness. Specifically, it requires finding a fixed-size solution to maximize the utility function, subject to the value of the fairness function not being below a threshold. Since BSM is inapproximable within any constant factor, we focus on designing efficient instance-dependent approximation schemes. Our algorithmic proposal comprises two methods, with different approximation factors, obtained by converting a BSM instance into other submodular optimization problem instances. Using real-world and synthetic datasets, we showcase applications of our proposed methods in three submodular maximization problems: maximum coverage, influence maximization, and facility location.
AbstractList Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence maximization, and recommendation. In many of these problems, the goal is to find a solution that maximizes the average utility over all users, for each of whom the utility is defined by a monotone submodular function. However, when the population of users is composed of several demographic groups, another critical problem is whether the utility is fairly distributed across different groups. Although the \emph{utility} and \emph{fairness} objectives are both desirable, they might contradict each other, and, to the best of our knowledge, little attention has been paid to optimizing them jointly. To fill this gap, we propose a new problem called \emph{Bicriteria Submodular Maximization} (BSM) to balance utility and fairness. Specifically, it requires finding a fixed-size solution to maximize the utility function, subject to the value of the fairness function not being below a threshold. Since BSM is inapproximable within any constant factor, we focus on designing efficient instance-dependent approximation schemes. Our algorithmic proposal comprises two methods, with different approximation factors, obtained by converting a BSM instance into other submodular optimization problem instances. Using real-world and synthetic datasets, we showcase applications of our proposed methods in three submodular maximization problems: maximum coverage, influence maximization, and facility location.
Author Wang, Ying
Li, Yuchen
Wang, Yanhao
Bonchi, Francesco
Author_xml – sequence: 1
  givenname: Yanhao
  surname: Wang
  fullname: Wang, Yanhao
– sequence: 2
  givenname: Yuchen
  surname: Li
  fullname: Li, Yuchen
– sequence: 3
  givenname: Francesco
  surname: Bonchi
  fullname: Bonchi, Francesco
– sequence: 4
  givenname: Ying
  surname: Wang
  fullname: Wang, Ying
BookMark eNotzc1KAzEUQOEgCtbaB3AXcKOLqTc3k2Sy1GJVGBF0XJc7Saop00ydH6k-vYKuzu47J-wwtSkwdiZgnhdKwRV1-_g5RxRiDmALOGATlFJkRY54zGZ9vwEA1AaVkhNW3lBDycX0xl-H2MThi1PyfEmxS6HveUz8Zay3rR8b6vgj7eM2ftMQ28QvquDeU3TU8Oewa7vh8pQdranpw-y_U1Ytb6vFfVY-3T0srsuMFGJWG2mtrYPT2hYepHPGmnXtwdROorZW50XtrafgKIegQAQPznoBFLTyQk7Z-R-769qPMfTDatOOXfo9rtBIoQVKg_IHeIxRGQ
ContentType Paper
Copyright 2023. This work is published under http://creativecommons.org/licenses/by-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: 2023. This work is published under http://creativecommons.org/licenses/by-sa/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID 8FE
8FG
ABJCF
ABUWG
AFKRA
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
HCIFZ
L6V
M7S
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.48550/arxiv.2211.00980
DatabaseName ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest Technology Collection
ProQuest One Community College
ProQuest Central
SciTech Collection (ProQuest)
ProQuest Engineering Collection
Engineering Database
ProQuest Central Premium
ProQuest One Academic (New)
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle Publicly Available Content Database
Engineering Database
Technology Collection
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest One Academic UKI Edition
ProQuest Central Korea
Materials Science & Engineering Collection
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
Engineering Collection
DatabaseTitleList Publicly Available Content Database
Database_xml – sequence: 1
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Physics
EISSN 2331-8422
Genre Working Paper/Pre-Print
GroupedDBID 8FE
8FG
ABJCF
ABUWG
AFKRA
ALMA_UNASSIGNED_HOLDINGS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
FRJ
HCIFZ
L6V
M7S
M~E
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
ID FETCH-LOGICAL-a522-b73999bec6698d03cc797fbd07bc32699648bd9daeca40e501ed0c9d10ae65d13
IEDL.DBID BENPR
IngestDate Mon Jun 30 08:19:40 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a522-b73999bec6698d03cc797fbd07bc32699648bd9daeca40e501ed0c9d10ae65d13
Notes SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
OpenAccessLink https://www.proquest.com/docview/2731612372?pq-origsite=%requestingapplication%
PQID 2731612372
PQPubID 2050157
ParticipantIDs proquest_journals_2731612372
PublicationCentury 2000
PublicationDate 20230619
PublicationDateYYYYMMDD 2023-06-19
PublicationDate_xml – month: 06
  year: 2023
  text: 20230619
  day: 19
PublicationDecade 2020
PublicationPlace Ithaca
PublicationPlace_xml – name: Ithaca
PublicationTitle arXiv.org
PublicationYear 2023
Publisher Cornell University Library, arXiv.org
Publisher_xml – name: Cornell University Library, arXiv.org
SSID ssj0002672553
Score 1.8354727
SecondaryResourceType preprint
Snippet Submodular function maximization is a fundamental combinatorial optimization problem with plenty of applications -- including data summarization, influence...
SourceID proquest
SourceType Aggregation Database
SubjectTerms Algorithms
Data science
Maximization
Optimization
Title Balancing Utility and Fairness in Submodular Maximization (Technical Report)
URI https://www.proquest.com/docview/2731612372
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB60VfDkGx-17MGDHmI3j2azJ6HSotCWoBXqqWz2ATk0rUkt9d-7k6Z6ELx4XMKGsLN882X22_kArsOQCg89wnzGjIMZy0lMYhxf8TZThipqyiaufTYcRuMxj6uCW1HJKjeYWAK1mkmskbc8tFiyMMu8-_m7g65ReLpaWWhsQx07lQU1qHe6w_j5u8rihcxyZn99nFk272qJfJUu7zwPe3dSHtFfIFxmlt7-f7_pAOqxmOv8ELZ0dgS7paJTFsfQ76BoUdrMRF4XKID9JCJTpCfSHNGNpBmxoDGdKdShkoFYpdPqSia5KevtGD2y5ue3JzDqdUcPj05lneAIS6ichFnewW14wpBHivpSMs5MoihLpOVr9h8niBLFldBSBFS3qasVlVy5VOiwrVz_FGrZLNNnQNqWv3g-ThUsCFQUucIPQpoY-2opmDmHxmZtJtX2LyY_C3Px9-NL2EP_dtReubwBtUX-oa9gRy4XaZE3q2g2UZD5Ykfx0yB--wI_4a0Y
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V07T8MwED6VFgQTb_Eo4AEkGEIdJ43jASHxqFr1ISSK1K1ybEfKQAppKe2P4j_iS1sYkNgYmC1bVu7y3dn3-T6A0yCgkqFGmMd57GDEcqI4ih1PiyrXMdU0zpu4tninE_Z64qEAH4u3MEirXGBiDtR6oPCOvMJQYsnCLGfXL68OqkZhdXUhoTFzi6aZvtsj2_CqcWfte8ZY7b57W3fmqgKOtLmGE3EbkoXdeRCIUFNPKS54HGnKI2VTGZv--2GkhZZGSZ-aKnWNpkpol0oTVLXr2WWXoOQj-OdMwcevKx0WcJuge7Paad4prCKzSTK-ZAwbhVIR0h-In4ex2vo_-wAbUHqQLybbhIJJt2AlZ6uq4Ta0bpCQqWzUJU8jJPdOiUw1qckkQ-QmSUosID4PNHJsSVtOkuf5c1NyntcS0DPJ7OxxsQPdv9j_LhTTQWr2gFRtbsY8nCq57-swdKXnBzSK7dJK8ngfygtT9Oe_9rD_bYeD34dPYLXebbf6rUaneQhrqFOPHDNXlKE4yt7MESyr8SgZZse5GxHo_7HVPgGgsQY_
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Balancing+Utility+and+Fairness+in+Submodular+Maximization+%28Technical+Report%29&rft.jtitle=arXiv.org&rft.au=Wang%2C+Yanhao&rft.au=Li%2C+Yuchen&rft.au=Bonchi%2C+Francesco&rft.au=Wang%2C+Ying&rft.date=2023-06-19&rft.pub=Cornell+University+Library%2C+arXiv.org&rft.eissn=2331-8422&rft_id=info:doi/10.48550%2Farxiv.2211.00980