IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v44y2022i4d10.1007_s10878-021-00774-6.html
   My bibliography  Save this article

Nonsubmodular constrained profit maximization from increment perspective

Author

Listed:
  • Liman Du

    (University of Chinese Academy of Science)

  • Shengminjie Chen

    (University of Chinese Academy of Science)

  • Suixiang Gao

    (University of Chinese Academy of Science)

  • Wenguo Yang

    (University of Chinese Academy of Science)

Abstract

The growing importance of online social networks where people share information with others leads to the emergence of viral marketing, a new way to promote the sales of products. A derivation of classical Influence Maximization (IM) problem is the Profit Maximization (PM) problem that we focus on in this paper. We propose the PM problem with a cardinality constraint in order to make it closer to the real marketing activities. Without a fixed and pre-determined budget for seed selection, the profit spread metric of PM considers the total benefit and cost. The difference between influence spread metric and profit spread metric is that the latter is no longer monotone and lose the property of submodularity in general. Due to the natural form as the difference between two submodular functions, the profit spread metric admits a DS decomposition. What matters is that we design a Marginal increment-based Prune and Search (MPS) algorithm. From the perspective of marginal increment, MPS algorithm can compute profit spread more directly and accurately. Extensive experiments demonstrate the effectiveness and outperformance of our algorithm.

Suggested Citation

  • Liman Du & Shengminjie Chen & Suixiang Gao & Wenguo Yang, 2022. "Nonsubmodular constrained profit maximization from increment perspective," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2598-2625, November.
  • Handle: RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00774-6
    DOI: 10.1007/s10878-021-00774-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00774-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-021-00774-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wenguo Yang & Yapu Zhang & Ding-Zhu Du, 2020. "Influence maximization problem: properties and algorithms," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 907-928, November.
    2. Xiang Li & H. George Du & Panos M. Pardalos, 2020. "A variation of DS decomposition in set function optimization," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 36-44, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xiang Li & H. George Du, 2020. "A short proof for stronger version of DS decomposition in set function optimization," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 901-906, November.
    2. Yoshio Sano & Ping Zhan, 2021. "Extended Random Assignment Mechanisms on a Family of Good Sets," SN Operations Research Forum, Springer, vol. 2(4), pages 1-30, December.
    3. Qiufen Ni & Hongwei Du, 2021. "On strict submodularity of social influence," Journal of Combinatorial Optimization, Springer, vol. 41(2), pages 348-356, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:44:y:2022:i:4:d:10.1007_s10878-021-00774-6. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.