A Greedy Approach for Offering to Telecom Subscribers

• URL: http://arxiv.org/abs/2308.12606v1
• Date: Thu, 24 Aug 2023 07:11:51 GMT
• Title: A Greedy Approach for Offering to Telecom Subscribers
• Authors: Piyush Kanti Bhunre, Tanmay Sen, and Arijit Sarkar
• Abstract summary: We propose a novel algorithm for solving offer optimization under heterogeneous offers. The proposed algorithm is efficient and accurate even for a very large subscriber-base.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Customer retention or churn prevention is a challenging task of a telecom operator. One of the effective approaches is to offer some attractive incentive or additional services or money to the subscribers for keeping them engaged and make sure they stay in the operator's network for longer time. Often, operators allocate certain amount of monetary budget to carry out the offer campaign. The difficult part of this campaign is the selection of a set of customers from a large subscriber-base and deciding the amount that should be offered to an individual so that operator's objective is achieved. There may be multiple objectives (e.g., maximizing revenue, minimizing number of churns) for selection of subscriber and selection of an offer to the selected subscriber. Apart from monetary benefit, offers may include additional data, SMS, hots-spot tethering, and many more. This problem is known as offer optimization. In this paper, we propose a novel combinatorial algorithm for solving offer optimization under heterogeneous offers by maximizing expected revenue under the scenario of subscriber churn, which is, in general, seen in telecom domain. The proposed algorithm is efficient and accurate even for a very large subscriber-base.

Related papers

• Procurement Auctions via Approximately Optimal Submodular Optimization [53.93943270902349]
  We study procurement auctions, where an auctioneer seeks to acquire services from strategic sellers with private costs. Our goal is to design computationally efficient auctions that maximize the difference between the quality of the acquired services and the total cost of the sellers.
  arXiv  Detail & Related papers  (2024-11-20T18:06:55Z)
• End-to-End Cost-Effective Incentive Recommendation under Budget Constraint with Uplift Modeling [12.160403526724476]
  We propose a novel End-to-End Cost-Effective Incentive Recommendation (E3IR) model under budget constraints. Specifically, our methods consist of two modules, i.e., the uplift prediction module and the differentiable allocation module. Our E3IR improves allocation performance compared to existing two-stage approaches.
  arXiv  Detail & Related papers  (2024-08-21T13:48:00Z)
• Training Greedy Policy for Proposal Batch Selection in Expensive Multi-Objective Combinatorial Optimization [52.80408805368928]
  We introduce a novel greedy-style subset selection algorithm for batch acquisition. Our experiments on the red fluorescent proteins show that our proposed method achieves the baseline performance in 1.69x fewer queries.
  arXiv  Detail & Related papers  (2024-06-21T05:57:08Z)
• Efficient Prompt Optimization Through the Lens of Best Arm Identification [50.56113809171805]
  This work provides a principled framework, TRIPLE, to efficiently perform prompt selection under an explicit budget constraint. It is built on a novel connection established between prompt optimization and fixed-budget best arm identification (BAI-FB) in multi-armed bandits (MAB)
  arXiv  Detail & Related papers  (2024-02-15T05:31:13Z)
• Incentivized Truthful Communication for Federated Bandits [61.759855777522255]
  We propose an incentive compatible (i.e., truthful) communication protocol, named Truth-FedBan. We show that Truth-FedBan still guarantees the sub-linear regret and communication cost without any overheads.
  arXiv  Detail & Related papers  (2024-02-07T00:23:20Z)
• Bidding Strategies for Proportional Representation in Advertisement Campaigns [8.269283912626873]
  We show that equitable bidding may not result in equitable outcomes due to heterogeneous levels of competition for different types of individuals. We consider alterations that make no change to the platform mechanism and instead change the bidding strategies used by advertisers.
  arXiv  Detail & Related papers  (2023-05-22T23:29:05Z)
• MNL-Bandits under Inventory and Limited Switches Constraints [38.960764902819434]
  We develop an efficient UCB-like algorithm to optimize the assortments while learning customers' choices from data. We prove that our algorithm can achieve a sub-linear regret bound $tildeOleft(T1-alpha/2right)$ if $O(Talpha)$ switches are allowed.
  arXiv  Detail & Related papers  (2022-04-22T16:02:27Z)
• Optimal Auction Design for the Gradual Procurement of Strategic Service Provider Agents [8.500525426182115]
  We consider an outsourcing problem where a software agent procures services from providers with uncertain reliabilities to complete a computational task before a strict deadline. The service consumer requires a procurement strategy that achieves the optimal balance between success probability and invocation cost. We design a novel procurement auction that provides the consumer with the highest possible revenue, while giving sufficient incentives to providers to tell the truth about their costs.
  arXiv  Detail & Related papers  (2021-10-25T12:14:47Z)
• E-Commerce Promotions Personalization via Online Multiple-Choice Knapsack with Uplift Modeling [1.027974860479791]
  We study the Online Constrained Multiple-Choice Promotions Personalization Problem. Our work formalizes the problem as an Online Multiple Choice Knapsack Problem. We provide a real-time adaptive method that guarantees budget constraints compliance.
  arXiv  Detail & Related papers  (2021-08-11T15:09:16Z)
• A Cooperative-Competitive Multi-Agent Framework for Auto-bidding in Online Advertising [53.636153252400945]
  We propose a general Multi-Agent reinforcement learning framework for Auto-Bidding, namely MAAB, to learn the auto-bidding strategies. Our approach outperforms several baseline methods in terms of social welfare and guarantees the ad platform's revenue.
  arXiv  Detail & Related papers  (2021-06-11T08:07:14Z)
• Dynamic Knapsack Optimization Towards Efficient Multi-Channel Sequential Advertising [52.3825928886714]
  We formulate the sequential advertising strategy optimization as a dynamic knapsack problem. We propose a theoretically guaranteed bilevel optimization framework, which significantly reduces the solution space of the original optimization space. To improve the exploration efficiency of reinforcement learning, we also devise an effective action space reduction approach.
  arXiv  Detail & Related papers  (2020-06-29T18:50:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.