Towards a Fair Allocation of Rewards in Multi-Level Marketing

An increasing number of businesses and organisations rely on existing users for finding new users or spreading a message. One of the widely used “refer-a-friend” mechanisms offers an equal reward to both the referrer and the invitee. This mechanism provides incentives for direct referrals and is fair to the invitee. On the other hand, multi-level marketing and recent social mobilisation experiments focus on mechanisms that incentivise both direct and indirect referrals. Such mechanisms share the reward for inviting a new member among the ancestors, usually in geometrically decreasing shares. A new member receives nothing at the time of joining. We study fairness in multi-level marketing mechanisms. We show how characteristic function games can be used to model referral marketing, show how the canonical fairness concept of the Shapley value can be applied to this setting, and establish the complexity of finding the Shapley value in each class, and provide a comparison of the Shapley value-based mechanism to existing referral mechanisms.

[1]  John R. Douceur,et al.  Lottery trees: motivational deployment of networked systems , 2007, SIGCOMM '07.

[2]  Thomas Moscibroda,et al.  Fair and resilient Incentive Tree mechanisms , 2013, PODC '13.

[3]  Wei Chen,et al.  Sybil-proof mechanisms in query incentive networks , 2013, EC '13.

[4]  Gabrielle Demange,et al.  On Group Stability in Hierarchies and Networks , 2004, Journal of Political Economy.

[5]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[6]  Thomas Moscibroda,et al.  Fair and resilient incentive tree mechanisms , 2013, PODC.

[7]  Vincent Conitzer,et al.  Complexity of determining nonemptiness of the core , 2003, EC '03.

[8]  Eyal Biyalogorsky,et al.  Customer Referral Management: Optimal Reward Programs , 2000 .

[9]  John R. Douceur,et al.  Lottery trees: motivational deployment of networked systems , 2007, SIGCOMM '07.

[10]  Jon M. Kleinberg,et al.  Query incentive networks , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[11]  Kevin Leyton-Brown,et al.  Proceedings of the 13th ACM Conference on Electronic Commerce, EC 2012, Valencia, Spain, June 4-8, 2012 , 2012, EC.

[12]  N. Jennings,et al.  Computational Coalition Formation , 2013 .

[13]  L. Shapley Cores of convex games , 1971 .

[14]  Donald B. Gillies,et al.  3. Solutions to General Non-Zero-Sum Games , 1959 .

[15]  Lisa Fleischer,et al.  Simple sybil-proof mechanisms for multi-level marketing , 2012, 2012 Proceedings IEEE INFOCOM Workshops.

[16]  Moshe Tennenholtz,et al.  Mechanisms for multi-level marketing , 2011, EC '11.

[17]  L. Shapley A Value for n-person Games , 1988 .

[18]  Moshe Babaioff,et al.  On bitcoin and red balloons , 2011, EC '12.

[19]  Alex Pentland,et al.  Time-Critical Social Mobilization , 2010, Science.

[20]  F. Buttle Word of mouth: understanding and managing referral marketing , 1998 .

[21]  Roger B. Myerson,et al.  Graphs and Cooperation in Games , 1977, Math. Oper. Res..

[22]  Manuel Cebrián,et al.  Finding red balloons with split contracts: robustness to individuals' selfishness , 2012, STOC '12.