{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/103204"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/103204","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A Bayesian bandit approach to personalized online coupon recommendations","abstract":"A digital coupon distributing firm selects coupons from its coupon pool and posts them online for its customers to activate them. Its objective is to maximize the total number of clicks that activate the coupons by sequential arriving customers. This paper resolves this problem by using a multi-armed bandit approach to balance the exploration (learning customers' preference for coupons) with exploitation (maximizing short term activation clicks). The proposed approach is evaluated with synthetic data. Results showed a 60% click lift compared to the benchmark approach.","abstract_html":"A digital coupon distributing firm selects coupons from its coupon pool and posts them online for its customers to activate them. Its objective is to maximize the total number of clicks that activate the coupons by sequential arriving customers. This paper resolves this problem by using a multi-armed bandit approach to balance the exploration (learning customers' preference for coupons) with exploitation (maximizing short term activation clicks). The proposed approach is evaluated with synthetic data. Results showed a 60% click lift compared to the benchmark approach.","abstract_has_math":false,"creators":["Song, Xiang, Ph. D. Massachusetts Institute of Technology"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Sloan School of Management.","school":null,"contributors":[],"advisors":["John D. C. Little."],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016","date_published":"2016","updated_at":"2026-07-22T22:21:28Z","subjects":["Sloan School of Management."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/103204","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["John D. C. Little."]},{"key":"dc:contributor.department","label":"Department","values":["Sloan School of Management."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Sloan School of Management."]},{"key":"dc:creator","label":"Author","values":["Song, Xiang, Ph. D. Massachusetts Institute of Technology"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2016-06-22T17:46:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2016-06-22T17:46:50Z"]},{"key":"dc:date.issued","label":"Date","values":["2016"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Sloan School of Management."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/103204"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis: S.M. in Management Research, Massachusetts Institute of Technology, Sloan School of Management, 2016.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 37-38)."]},{"key":"dc:description.abstract","label":"Abstract","values":["A digital coupon distributing firm selects coupons from its coupon pool and posts them online for its customers to activate them. Its objective is to maximize the total number of clicks that activate the coupons by sequential arriving customers. This paper resolves this problem by using a multi-armed bandit approach to balance the exploration (learning customers' preference for coupons) with exploitation (maximizing short term activation clicks). The proposed approach is evaluated with synthetic data. Results showed a 60% click lift compared to the benchmark approach."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["S.M. in Management Research"]},{"key":"dc:title","label":"Title","values":["A Bayesian bandit approach to personalized online coupon recommendations"]}]}],"canonical_facts":{"dc:contributor.advisor":["John D. C. Little."],"dc:contributor.department":["Sloan School of Management."],"dc:contributor.other":["Sloan School of Management."],"dc:creator":["Song, Xiang, Ph. D. Massachusetts Institute of Technology"],"dc:date.accessioned":["2016-06-22T17:46:50Z"],"dc:date.available":["2016-06-22T17:46:50Z"],"dc:date.issued":["2016"],"dc:description":["Thesis: S.M. in Management Research, Massachusetts Institute of Technology, Sloan School of Management, 2016.","Cataloged from PDF version of thesis.","Includes bibliographical references (pages 37-38)."],"dc:description.abstract":["A digital coupon distributing firm selects coupons from its coupon pool and posts them online for its customers to activate them. Its objective is to maximize the total number of clicks that activate the coupons by sequential arriving customers. This paper resolves this problem by using a multi-armed bandit approach to balance the exploration (learning customers' preference for coupons) with exploitation (maximizing short term activation clicks). The proposed approach is evaluated with synthetic data. Results showed a 60% click lift compared to the benchmark approach."],"dc:description.degree":["S.M. in Management Research"],"dc:identifier.uri":["http://hdl.handle.net/1721.1/103204"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Sloan School of Management."],"dc:title":["A Bayesian bandit approach to personalized online coupon recommendations"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:21:28Z"}