Message Allocation Algorithms for Mobile Marketing Campaigns
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current mobile marketing systems face challenges in efficiently allocating resources for targeted message delivery due to limited processing capacity and time constraints, often resulting in either reduced accuracy or speed, leading to inefficient use of network resources and potential misdelivery of advertisements.
Innovation Solution
A method utilizing multiple allocation algorithms to define and select message allocations based on predefined criteria and profile information, allowing for flexible resource allocation and scheduling, which improves efficiency and accuracy in message delivery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If a reservation method using limited processing capacity is optimized for high accuracy to guarantee maximum number of messages sent, then message delivery accuracy is improved, but processing speed becomes too slow for high numbers of advertisement receivers
Solution Approach 1:
The patent segments the large-scale message allocation problem into multiple smaller sub-problems by dividing advertisement receivers into different groups or batches. This allows the system to process allocations in manageable portions, maintaining accuracy while improving overall processing speed through parallel or sequential handling of smaller datasets.
Solution Approach 2:
The system performs preliminary actions by pre-calculating and storing allocation criteria, receiver profiles, and message priorities before the actual allocation process. This preprocessing enables faster real-time decision-making during message delivery, reducing the computational burden during critical allocation moments while maintaining high accuracy.
2Productivity
If a reservation method using limited processing capacity is optimized for speed to process high numbers of advertisement receivers, then processing speed is improved, but accuracy is reduced leading to wrong type of or too many messages
Solution Approach 1:
The system implements self-service mechanisms where allocation decisions are made autonomously based on pre-defined rules and criteria stored in the system. This eliminates the need for complex real-time calculations for each message allocation, enabling high-speed processing while maintaining accuracy through rule-based automated decision-making.
Solution Approach 2:
The patent uses copying by creating simplified models or representations of allocation scenarios that can be processed quickly. These copies or proxies allow the system to evaluate multiple allocation options rapidly without the full computational overhead of detailed analysis, then apply the best match to actual message delivery.
3Measurement precision
If multiple allocation algorithms are used to define message allocations, then resource allocation flexibility and accuracy are improved, but system complexity increases
Solution Approach 1:
The system dynamically selects and applies different allocation algorithms based on the specific characteristics of the message campaign, receiver profiles, and available resources. Rather than using a fixed complex multi-algorithm system, the platform adapts the algorithm selection in real-time, using only the necessary algorithms for each scenario, thereby reducing overall system complexity while maintaining high allocation accuracy.
Solution Approach 2:
The patent changes parameters such as algorithm selection, allocation thresholds, and priority weights based on campaign requirements and performance feedback. This parameter-based flexibility allows the system to achieve high allocation accuracy through configuration rather than structural complexity, simplifying the overall system architecture.
Data Source
AI summary
A system for generating a schedule for use in triggering transmission of message content in a telecommunications network is provided. The system comprises a store for storing profiles of a plurality of recipients, and a plurality of message delivery campaigns with one or more criteria. The campaigns to be executed in relation to a given inventory, which may relate to a predetermined time period, may be arranged into one or more campaign clusters. A suitable allocation method may be used individually for each of said plurality of campaign clusters to allocate, among the plurality of recipients, target recipients for each of the campaign clusters based on campaign criteria and the profiles. The allocation process may be repeated to obtain, for example as high a number of messages as possible with the network resources available without exceeding a predetermined maximum number of messages per any given recipient. After the allocation process is completed, the campaign messages are delivered to the allocated target recipients via a communications network.