{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:30:03Z","timestamp":1750307403811,"version":"3.41.0"},"reference-count":6,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2011,1,3]],"date-time":"2011-01-03T00:00:00Z","timestamp":1294012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMETRICS Perform. Eval. Rev."],"published-print":{"date-parts":[[2011,1,3]]},"abstract":"<jats:p>We propose to exploit online social networks in order to reveal user preferences such that goods and services might be targeted appropriately. We consider goods and services that are consumed periodically, and a user model where users could buy different numbers of goods at a marked (\"high\") price and at a discounted (\"low\") price. The problem is to identify users who are interested in the good, and to discount them sufficiently that the entire demand is realized, but not so much that revenue is compromised. Using techniques from \"backpressure routing\" used for control of multihop communication networks, we develop a multi-hop coupon forwarding scheme in which users are incentivized to forward the right number of coupons to appropriate neighbors such that the above target is achieved. We also develop a simple delay-based heuristic algorithm that also shows a near-optimal performance.<\/jats:p>","DOI":"10.1145\/1925019.1925025","type":"journal-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T14:58:13Z","timestamp":1295881093000},"page":"26-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Targeted coupon distribution using social networks"],"prefix":"10.1145","volume":"38","author":[{"given":"Srinivas","family":"Shakkottai","sequence":"first","affiliation":[{"name":"Texas A&amp;M University"}]},{"given":"Lei","family":"Ying","sequence":"additional","affiliation":[{"name":"Iowa State University"}]},{"given":"Sankalp","family":"Sah","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University"}]}],"member":"320","published-online":{"date-parts":[[2011,1,3]]},"reference":[{"unstructured":"\"mGinger \" http:\/\/www.mginger.com\/ 2009.  \"mGinger \" http:\/\/www.mginger.com\/ 2009.","key":"e_1_2_1_1_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1109\/9.182479"},{"key":"e_1_2_1_3_1","first-page":"1723","volume-title":"IEEE Infocom.","volume":"3","author":"Neely M.","year":"2005","unstructured":"M. Neely , E. Modiano , and C. Li , \" Fairness and optimal stochastic control for heterogeneous networks,\" in Proc . IEEE Infocom. , vol. 3 , Miami, FL , March 2005 , pp. 1723 -- 1734 . M. Neely, E. Modiano, and C. Li, \"Fairness and optimal stochastic control for heterogeneous networks,\" in Proc. IEEE Infocom., vol. 3, Miami, FL, March 2005, pp. 1723--1734."},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1007\/s11134-005-1450-0"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1109\/JSAC.2006.879361"},{"key":"e_1_2_1_6_1","volume-title":"Barcelona","author":"Chen L.","year":"2006","unstructured":"L. Chen , S. H. Low , M. Chiang , and J. C. Doyle , \" Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks,\" in IEEE Infocom , Barcelona , Spain , April 2006 . L. Chen, S. H. Low, M. Chiang, and J. C. Doyle, \"Cross-layer congestion control, routing and scheduling design in ad hoc wireless networks,\" in IEEE Infocom, Barcelona, Spain, April 2006."}],"container-title":["ACM SIGMETRICS Performance Evaluation Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1925019.1925025","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1925019.1925025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:25Z","timestamp":1750246765000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1925019.1925025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,3]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,1,3]]}},"alternative-id":["10.1145\/1925019.1925025"],"URL":"https:\/\/doi.org\/10.1145\/1925019.1925025","relation":{},"ISSN":["0163-5999"],"issn-type":[{"type":"print","value":"0163-5999"}],"subject":[],"published":{"date-parts":[[2011,1,3]]},"assertion":[{"value":"2011-01-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}