Profit maximization problem with coupons in social networks

DOI10.1007/978-3-030-04618-7_5MaRDI QIDQ6049082zbMATH OpenOpenAlexFDO

Authors Bin Liu, Xiao Li, Hui-Juan Wang, Qizhi Fang, Junyu Dong, Weili Wu

Publication date 16 October 2023

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-04618-7_5

zbMATH Keywords

approximation algorithmprofit maximizationsocial network

Mathematics Subject Classification ID

Approximation algorithms (68W25) Marketing, advertising (90B60) Social networks; opinion dynamics (91D30)

Review text

This paper studies profit maximization problem with coupons in social networks. The paper presents profit maximization problem with coupons problem a PMCA algorithm runs in \(O(\ln np\cdot mn^3\ln n(l\ln n+n\ln 2)/\varepsilon^3)\) expected time and can return a \(1/3-\varepsilon\)-approximate solution with a high probability, where \(G\) is the given network with \(n\) nodes and \(m\) edges, and price of a product \(p>0\), \(\varepsilon\in(0,1)\), \(l>0\). Based on the reverse reachable set, the paper proposes modified-reverse reachable set with is more suitable under the linear threshold-coupons and valuations diffusion model. For the entire collection see [Zbl 1400.68037].

Recommendations

• Profit maximization problem with coupons in social networks
• Nonsubmodular constrained profit maximization from increment perspective
• Maximizing profit of multiple adoptions in social networks with a martingale approach
• Profit maximization for multiple products in community-based social networks
• Nonsubmodular Constrained Profit Maximization in Attribute Networks

Cited in

(2)

• Profit maximization for multiple products in community-based social networks
• Budget-constrained profit maximization without non-negative objective assumption in social networks

This page was built for publication: Profit maximization problem with coupons in social networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6049082)