Loading…
Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection
Online electronic coupon (e-coupon) is becoming a primary tool for e-commerce platforms to attract users to place orders. E-coupons are the digital equivalent of traditional paper coupons which provide customers with discounts or gifts. One of the fundamental problems related is how to deliver e-cou...
Saved in:
Published in: | arXiv.org 2020-08 |
---|---|
Main Authors: | , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | |
---|---|
cites | |
container_end_page | |
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Li, Liangwei Sun, Liucheng Weng, Chenwei Huo, Chengfu Ren, Weijun |
description | Online electronic coupon (e-coupon) is becoming a primary tool for e-commerce platforms to attract users to place orders. E-coupons are the digital equivalent of traditional paper coupons which provide customers with discounts or gifts. One of the fundamental problems related is how to deliver e-coupons with minimal cost while users' willingness to place an order is maximized. We call this problem the coupon allocation problem. This is a non-trivial problem since the number of regular users on a mature e-platform often reaches hundreds of millions and the types of e-coupons to be allocated are often multiple. The policy space is extremely large and the online allocation has to satisfy a budget constraint. Besides, one can never observe the responses of one user under different policies which increases the uncertainty of the policy making process. Previous work fails to deal with these challenges. In this paper, we decompose the coupon allocation task into two subtasks: the user intent detection task and the allocation task. Accordingly, we propose a two-stage solution: at the first stage (detection stage), we put forward a novel Instantaneous Intent Detection Network (IIDN) which takes the user-coupon features as input and predicts user real-time intents; at the second stage (allocation stage), we model the allocation problem as a Multiple-Choice Knapsack Problem (MCKP) and provide a computational efficient allocation method using the intents predicted at the detection stage. We conduct extensive online and offline experiments and the results show the superiority of our proposed framework, which has brought great profits to the platform and continues to function online. |
doi_str_mv | 10.48550/arxiv.2008.09982 |
format | article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2436980288</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2436980288</sourcerecordid><originalsourceid>FETCH-LOGICAL-a528-a91f86fbda69c3838540f81c93412d392cea496968b9c52572a371b97d7d60ff3</originalsourceid><addsrcrecordid>eNotjcFKAzEURYMgWGo_wF3A9dTMyyTz4q7UqgWloBWXJZN5IykxqZOp2L93QFf3LO65l7GrUswrVErc2P7Hf89BCJwLYxDO2ASkLAusAC7YLOe9EAJ0DUrJCXOvB4qtjx_8OUU68XefKZxu-SYGH4mvArmhT9E7vkzHQ4p8EUJydvAjNjZTy0d4IRuKrf8k_pap5-s4UBz4HQ2jPBYv2XlnQ6bZf07Z9n61XT4WT5uH9XLxVFgFWFhTdqi7prXaOIkSVSU6LJ2RVQmtNODIVkYbjY1xClQNVtZlY-q2brXoOjll13-zhz59HSkPu3069nF83EEltUEBiPIXw2ZWjQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2436980288</pqid></control><display><type>article</type><title>Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection</title><source>Publicly Available Content Database</source><creator>Li, Liangwei ; Sun, Liucheng ; Weng, Chenwei ; Huo, Chengfu ; Ren, Weijun</creator><creatorcontrib>Li, Liangwei ; Sun, Liucheng ; Weng, Chenwei ; Huo, Chengfu ; Ren, Weijun</creatorcontrib><description>Online electronic coupon (e-coupon) is becoming a primary tool for e-commerce platforms to attract users to place orders. E-coupons are the digital equivalent of traditional paper coupons which provide customers with discounts or gifts. One of the fundamental problems related is how to deliver e-coupons with minimal cost while users' willingness to place an order is maximized. We call this problem the coupon allocation problem. This is a non-trivial problem since the number of regular users on a mature e-platform often reaches hundreds of millions and the types of e-coupons to be allocated are often multiple. The policy space is extremely large and the online allocation has to satisfy a budget constraint. Besides, one can never observe the responses of one user under different policies which increases the uncertainty of the policy making process. Previous work fails to deal with these challenges. In this paper, we decompose the coupon allocation task into two subtasks: the user intent detection task and the allocation task. Accordingly, we propose a two-stage solution: at the first stage (detection stage), we put forward a novel Instantaneous Intent Detection Network (IIDN) which takes the user-coupon features as input and predicts user real-time intents; at the second stage (allocation stage), we model the allocation problem as a Multiple-Choice Knapsack Problem (MCKP) and provide a computational efficient allocation method using the intents predicted at the detection stage. We conduct extensive online and offline experiments and the results show the superiority of our proposed framework, which has brought great profits to the platform and continues to function online.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2008.09982</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Discount coupons ; Discounts ; Knapsack problem ; Real time</subject><ispartof>arXiv.org, 2020-08</ispartof><rights>2020. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2436980288?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>Li, Liangwei</creatorcontrib><creatorcontrib>Sun, Liucheng</creatorcontrib><creatorcontrib>Weng, Chenwei</creatorcontrib><creatorcontrib>Huo, Chengfu</creatorcontrib><creatorcontrib>Ren, Weijun</creatorcontrib><title>Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection</title><title>arXiv.org</title><description>Online electronic coupon (e-coupon) is becoming a primary tool for e-commerce platforms to attract users to place orders. E-coupons are the digital equivalent of traditional paper coupons which provide customers with discounts or gifts. One of the fundamental problems related is how to deliver e-coupons with minimal cost while users' willingness to place an order is maximized. We call this problem the coupon allocation problem. This is a non-trivial problem since the number of regular users on a mature e-platform often reaches hundreds of millions and the types of e-coupons to be allocated are often multiple. The policy space is extremely large and the online allocation has to satisfy a budget constraint. Besides, one can never observe the responses of one user under different policies which increases the uncertainty of the policy making process. Previous work fails to deal with these challenges. In this paper, we decompose the coupon allocation task into two subtasks: the user intent detection task and the allocation task. Accordingly, we propose a two-stage solution: at the first stage (detection stage), we put forward a novel Instantaneous Intent Detection Network (IIDN) which takes the user-coupon features as input and predicts user real-time intents; at the second stage (allocation stage), we model the allocation problem as a Multiple-Choice Knapsack Problem (MCKP) and provide a computational efficient allocation method using the intents predicted at the detection stage. We conduct extensive online and offline experiments and the results show the superiority of our proposed framework, which has brought great profits to the platform and continues to function online.</description><subject>Discount coupons</subject><subject>Discounts</subject><subject>Knapsack problem</subject><subject>Real time</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotjcFKAzEURYMgWGo_wF3A9dTMyyTz4q7UqgWloBWXJZN5IykxqZOp2L93QFf3LO65l7GrUswrVErc2P7Hf89BCJwLYxDO2ASkLAusAC7YLOe9EAJ0DUrJCXOvB4qtjx_8OUU68XefKZxu-SYGH4mvArmhT9E7vkzHQ4p8EUJydvAjNjZTy0d4IRuKrf8k_pap5-s4UBz4HQ2jPBYv2XlnQ6bZf07Z9n61XT4WT5uH9XLxVFgFWFhTdqi7prXaOIkSVSU6LJ2RVQmtNODIVkYbjY1xClQNVtZlY-q2brXoOjll13-zhz59HSkPu3069nF83EEltUEBiPIXw2ZWjQ</recordid><startdate>20200823</startdate><enddate>20200823</enddate><creator>Li, Liangwei</creator><creator>Sun, Liucheng</creator><creator>Weng, Chenwei</creator><creator>Huo, Chengfu</creator><creator>Ren, Weijun</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20200823</creationdate><title>Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection</title><author>Li, Liangwei ; Sun, Liucheng ; Weng, Chenwei ; Huo, Chengfu ; Ren, Weijun</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a528-a91f86fbda69c3838540f81c93412d392cea496968b9c52572a371b97d7d60ff3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Discount coupons</topic><topic>Discounts</topic><topic>Knapsack problem</topic><topic>Real time</topic><toplevel>online_resources</toplevel><creatorcontrib>Li, Liangwei</creatorcontrib><creatorcontrib>Sun, Liucheng</creatorcontrib><creatorcontrib>Weng, Chenwei</creatorcontrib><creatorcontrib>Huo, Chengfu</creatorcontrib><creatorcontrib>Ren, Weijun</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering collection</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Li, Liangwei</au><au>Sun, Liucheng</au><au>Weng, Chenwei</au><au>Huo, Chengfu</au><au>Ren, Weijun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection</atitle><jtitle>arXiv.org</jtitle><date>2020-08-23</date><risdate>2020</risdate><eissn>2331-8422</eissn><abstract>Online electronic coupon (e-coupon) is becoming a primary tool for e-commerce platforms to attract users to place orders. E-coupons are the digital equivalent of traditional paper coupons which provide customers with discounts or gifts. One of the fundamental problems related is how to deliver e-coupons with minimal cost while users' willingness to place an order is maximized. We call this problem the coupon allocation problem. This is a non-trivial problem since the number of regular users on a mature e-platform often reaches hundreds of millions and the types of e-coupons to be allocated are often multiple. The policy space is extremely large and the online allocation has to satisfy a budget constraint. Besides, one can never observe the responses of one user under different policies which increases the uncertainty of the policy making process. Previous work fails to deal with these challenges. In this paper, we decompose the coupon allocation task into two subtasks: the user intent detection task and the allocation task. Accordingly, we propose a two-stage solution: at the first stage (detection stage), we put forward a novel Instantaneous Intent Detection Network (IIDN) which takes the user-coupon features as input and predicts user real-time intents; at the second stage (allocation stage), we model the allocation problem as a Multiple-Choice Knapsack Problem (MCKP) and provide a computational efficient allocation method using the intents predicted at the detection stage. We conduct extensive online and offline experiments and the results show the superiority of our proposed framework, which has brought great profits to the platform and continues to function online.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2008.09982</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2020-08 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2436980288 |
source | Publicly Available Content Database |
subjects | Discount coupons Discounts Knapsack problem Real time |
title | Spending Money Wisely: Online Electronic Coupon Allocation based on Real-Time User Intent Detection |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T23%3A14%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Spending%20Money%20Wisely:%20Online%20Electronic%20Coupon%20Allocation%20based%20on%20Real-Time%20User%20Intent%20Detection&rft.jtitle=arXiv.org&rft.au=Li,%20Liangwei&rft.date=2020-08-23&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2008.09982&rft_dat=%3Cproquest%3E2436980288%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a528-a91f86fbda69c3838540f81c93412d392cea496968b9c52572a371b97d7d60ff3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2436980288&rft_id=info:pmid/&rfr_iscdi=true |