Discount targeting in online social networks using backpressure-based learning

Srinivas Shakkottai, Lei Ying

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Online social networks are increasingly being seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We consider a general user model, wherein users could buy different numbers of goods at a marked and at a discounted price. Our first objective is to learn which users would be interested in a particular good. Second, we would like to knowhow much to discount these users such that the entire demand is realized, but not so much that profits are decreased. We develop algorithms for multihop forwarding of discount coupons over an online social network, in which users forward such coupons to each other in return for a reward. Coupling this idea with the implicit learning associated with backpressure routing (originally developed for multihopwireless networks),we showhowto realize optimal revenue. Using simulations, we illustrate its superior performance as compared to random coupon forwarding on different social network topologies. We then propose a simpler heuristic algorithm and using simulations, and show that its performance approaches that of backpressure routing.

Original languageEnglish (US)
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages427-455
Number of pages29
Volume58
DOIs
StatePublished - 2012
Externally publishedYes

Publication series

NameSpringer Optimization and Its Applications
Volume58
ISSN (Print)19316828
ISSN (Electronic)19316836

Fingerprint

Discount
Social Networks
Routing
User Model
User Preferences
Multi-hop
Reward
Network Topology
Heuristic algorithm
Profit
Simulation
Entire
Target
Learning
Awareness

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Shakkottai, S., & Ying, L. (2012). Discount targeting in online social networks using backpressure-based learning. In Springer Optimization and Its Applications (Vol. 58, pp. 427-455). (Springer Optimization and Its Applications; Vol. 58). Springer International Publishing. https://doi.org/10.1007/978-1-4614-0857-4_14

Discount targeting in online social networks using backpressure-based learning. / Shakkottai, Srinivas; Ying, Lei.

Springer Optimization and Its Applications. Vol. 58 Springer International Publishing, 2012. p. 427-455 (Springer Optimization and Its Applications; Vol. 58).

Research output: Chapter in Book/Report/Conference proceedingChapter

Shakkottai, S & Ying, L 2012, Discount targeting in online social networks using backpressure-based learning. in Springer Optimization and Its Applications. vol. 58, Springer Optimization and Its Applications, vol. 58, Springer International Publishing, pp. 427-455. https://doi.org/10.1007/978-1-4614-0857-4_14
Shakkottai S, Ying L. Discount targeting in online social networks using backpressure-based learning. In Springer Optimization and Its Applications. Vol. 58. Springer International Publishing. 2012. p. 427-455. (Springer Optimization and Its Applications). https://doi.org/10.1007/978-1-4614-0857-4_14
Shakkottai, Srinivas ; Ying, Lei. / Discount targeting in online social networks using backpressure-based learning. Springer Optimization and Its Applications. Vol. 58 Springer International Publishing, 2012. pp. 427-455 (Springer Optimization and Its Applications).
@inbook{39f83ababa9b44a1ba173ae6c795bc5d,
title = "Discount targeting in online social networks using backpressure-based learning",
abstract = "Online social networks are increasingly being seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We consider a general user model, wherein users could buy different numbers of goods at a marked and at a discounted price. Our first objective is to learn which users would be interested in a particular good. Second, we would like to knowhow much to discount these users such that the entire demand is realized, but not so much that profits are decreased. We develop algorithms for multihop forwarding of discount coupons over an online social network, in which users forward such coupons to each other in return for a reward. Coupling this idea with the implicit learning associated with backpressure routing (originally developed for multihopwireless networks),we showhowto realize optimal revenue. Using simulations, we illustrate its superior performance as compared to random coupon forwarding on different social network topologies. We then propose a simpler heuristic algorithm and using simulations, and show that its performance approaches that of backpressure routing.",
author = "Srinivas Shakkottai and Lei Ying",
year = "2012",
doi = "10.1007/978-1-4614-0857-4_14",
language = "English (US)",
volume = "58",
series = "Springer Optimization and Its Applications",
publisher = "Springer International Publishing",
pages = "427--455",
booktitle = "Springer Optimization and Its Applications",

}

TY - CHAP

T1 - Discount targeting in online social networks using backpressure-based learning

AU - Shakkottai, Srinivas

AU - Ying, Lei

PY - 2012

Y1 - 2012

N2 - Online social networks are increasingly being seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We consider a general user model, wherein users could buy different numbers of goods at a marked and at a discounted price. Our first objective is to learn which users would be interested in a particular good. Second, we would like to knowhow much to discount these users such that the entire demand is realized, but not so much that profits are decreased. We develop algorithms for multihop forwarding of discount coupons over an online social network, in which users forward such coupons to each other in return for a reward. Coupling this idea with the implicit learning associated with backpressure routing (originally developed for multihopwireless networks),we showhowto realize optimal revenue. Using simulations, we illustrate its superior performance as compared to random coupon forwarding on different social network topologies. We then propose a simpler heuristic algorithm and using simulations, and show that its performance approaches that of backpressure routing.

AB - Online social networks are increasingly being seen as a means of obtaining awareness of user preferences. Such awareness could be used to target goods and services at them. We consider a general user model, wherein users could buy different numbers of goods at a marked and at a discounted price. Our first objective is to learn which users would be interested in a particular good. Second, we would like to knowhow much to discount these users such that the entire demand is realized, but not so much that profits are decreased. We develop algorithms for multihop forwarding of discount coupons over an online social network, in which users forward such coupons to each other in return for a reward. Coupling this idea with the implicit learning associated with backpressure routing (originally developed for multihopwireless networks),we showhowto realize optimal revenue. Using simulations, we illustrate its superior performance as compared to random coupon forwarding on different social network topologies. We then propose a simpler heuristic algorithm and using simulations, and show that its performance approaches that of backpressure routing.

UR - http://www.scopus.com/inward/record.url?scp=84978873075&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84978873075&partnerID=8YFLogxK

U2 - 10.1007/978-1-4614-0857-4_14

DO - 10.1007/978-1-4614-0857-4_14

M3 - Chapter

VL - 58

T3 - Springer Optimization and Its Applications

SP - 427

EP - 455

BT - Springer Optimization and Its Applications

PB - Springer International Publishing

ER -