IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i4p471-484.html
   My bibliography  Save this article

Dynamic expansions of social followings with lotteries and give-aways

Author

Listed:
  • Hanqi Wen
  • Jingtong Zhao
  • Van-Anh Truong
  • Jie Song

Abstract

The problem of how to attract a robust following on social media is one of the most pressing for influencers. We study a common practice on popular microblogging platforms such as Twitter, of influencers’ expanding their followings by running lotteries and giveaways. We are interested in how the lottery size and the seeding decisions influence the information propagation and the final reward for such a campaign. We construct an information-diffusion model based on a random graph, and show that the market demand curve of the lottery reward via the promotion of the social network is “S”-shaped. This property lays a foundation for finding the optimal lottery size. Second, we observe that (i) dynamic seeding could re-stimulate the spread of information and (ii) with a fixed budget, seeding at two fixed occasions is always better than seeding once at the beginning. This observation motivates us to study the joint optimization of lottery size and adaptive seeding. We model the adaptive seeding problem as a Markov Decision Process. We find the monotonicity of the value functions and trends in the optimal actions, and we show that with adaptive seeding, the reward curve is approximately “S”-shaped with respect to the lottery size.

Suggested Citation

  • Hanqi Wen & Jingtong Zhao & Van-Anh Truong & Jie Song, 2024. "Dynamic expansions of social followings with lotteries and give-aways," IISE Transactions, Taylor & Francis Journals, vol. 56(4), pages 471-484, April.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:4:p:471-484
    DOI: 10.1080/24725854.2023.2220772
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2220772
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2023.2220772?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:uiiexx:v:56:y:2024:i:4:p:471-484. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.