Abstract
Recently, a new business model called online group buying is emerging into our daily lives. For example, the online business platforms provide people group-discount coupons which will be issued for at least k buyers grouping for a purchase. With the coupon link widely shared over the social platforms, they hope to promote people into groups to facilitate more purchases. Inspired by aforementioned real-world scenario with grouping constraint of a given minimum number of group members (κ-grouping constraint), in this paper, we analyze and model the diffusion-group behavior, and propose the κ-grouping joining influence maximization (κ-GJIM) problem. Our problem aims to choose budgeted seeds to maximize the number of κ-grouping joiners by social influence, where a κ-grouping joiner is a person who can group with at least κ−1 (κ≥2) like-mind partners. We prove that this problem is NP-hard. We also prove that the computation of objective is #P-hard and then propose an efficient method to estimate the objective. We show that κ-GJIM is a non-submodular optimization problem, and then design two algorithms to solve it. At last, the experiments based on real-world datasets show that our methods provide good strategies for maximizing the influence with κ-grouping constraint.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
