scispace - formally typeset
Search or ask a question
Author

Barak Libai

Bio: Barak Libai is an academic researcher from Interdisciplinary Center Herzliya. The author has contributed to research in topics: Customer retention & Customer lifetime value. The author has an hindex of 28, co-authored 47 publications receiving 6517 citations. Previous affiliations of Barak Libai include Technion – Israel Institute of Technology & Tel Aviv University.

Papers
More filters
Journal ArticleDOI
TL;DR: The results clearly indicate that information dissemination is dominated by both weak and strong w-o-m, rather than by advertising, which means that strong and weak ties become the main forces propelling growth.
Abstract: Though word-of-mouth (w-o-m) communications is a pervasive and intriguing phenomenon, little is known on its underlying process of personal communications. Moreover as marketers are getting more interested in harnessing the power of w-o-m, for e-business and other net related activities, the effects of the different communications types on macro level marketing is becoming critical. In particular we are interested in the breakdown of the personal communication between closer and stronger communications that are within an individual's own personal group (strong ties) and weaker and less personal communications that an individual makes with a wide set of other acquaintances and colleagues (weak ties). We use a technique borrowed from Complex Systems Analysis called stochastic cellular automata in order to generate data and analyze the results so that answers to our main research issues could be ascertained. The following summarizes the impact of strong and weak ties on the speed of acceptance of a new product: ••The influence of weak ties is at least as strong as the influence of strong ties. Despite the relative inferiority of the weak tie parameter in the model's assumptions, their effect approximates or exceeds that of strong ties, in all stages of the product life cycle. ••External marketing efforts (e.g., advertising) are effective. However, beyond a relatively early stage of the growth cycle of the new product, their efficacy quickly diminishes and strong and weak ties become the main forces propelling growth. The results clearly indicate that information dissemination is dominated by both weak and strong w-o-m, rather than by advertising. ••The effect of strong ties diminishes as personal network size decreases. Market attributes were also found to mediate the effects of weak and strong ties. When personal networks are small, weak ties were found to have a stronger impact on information dissemination than strong ties.

2,044 citations

Journal ArticleDOI
TL;DR: In this paper, the authors take a broad view of C2C interactions and their effects and highlight areas of significant research interest in this domain, including social system issues related to individuals and to online communities.
Abstract: The increasing emphasis on understanding the antecedents and consequences of customer-to-customer (C2C) interactions is one of the essential developments of customer management in recent years. This interest is driven much by new online environments that enable customers to be connected in numerous new ways and also supply researchers’ access to rich C2C data. These developments present an opportunity and a challenge for firms and researchers who need to identify the aspects of C2C research on which to focus, as well as develop research methods that take advantage of these new data. The aim here is to take a broad view of C2C interactions and their effects and to highlight areas of significant research interest in this domain. The authors look at four main areas: the different dimensions of C2C interactions; social system issues related to individuals and to online communities; C2C context issues including product, channel, relational and market characteristics; and the identification, modeling, and assessment of business outcomes of C2C interactions.

590 citations

Journal ArticleDOI
TL;DR: In this paper, the authors identify a list of unanswered questions of potential interest to both researchers and managers, and identify and discuss four principal, non-mutually exclusive, roles.
Abstract: Consumer choice is influenced in a direct and meaningful way by the actions taken by others. These “actions” range from face-to-face recommendations from a friend to the passive observation of what a stranger is wearing. We refer to the set of such contexts as “social interactions” (SI). We believe that at least some of the SI effects are partially within the firm’s control and that this represents an exciting research opportunity. We present an agenda that identifies a list of unanswered questions of potential interest to both researchers and managers. In order to appreciate the firm’s choices with respect to its management of SI, it is important to first evaluate where we are in terms of understanding the phenomena themselves. We highlight five questions in this regard: (1) What are the antecedents of word of mouth (WOM)? (2) How does the transmission of positive WOM differ from that of negative WOM? (3) How does online WOM differ from offline WOM? (4) What is the impact of WOM? (5) How can we measure WOM? Finally, we identify and discuss four principal, non-mutually exclusive, roles

587 citations

Journal ArticleDOI
TL;DR: In this article, the authors investigate when referral rewards should be offered to motivate referral and derive the optimal combination of reward and price that will lead to the most profitable referrals, and highlight the difference between lowering price and offering rewards as tools to motivate referrals.
Abstract: Sellers who plan to capitalize on the lifetime value of customers need to manage the sales potential from customer referrals proactively. To encourage existing customers to generate referrals, a seller can offer exceptional value to current customers through either excellent quality or a very attractive price. Rewards to customers for referring other customers can also encourage referrals. We investigate when referral rewards should be offered to motivate referrals and derive the optimal combination of reward and price that will lead to the most profitable referrals. We define a delighted customer as one who obtains a positive level of surplus above a threshold level and, consequently, recommends the product to another customer. We show that the use of referral rewards depends on how demanding consumers are before they are willing to recommend i.e., on the delight threshold level. The optimal mix of price and referral reward falls into three regions: 1 When customers are easy to delight, the optimal strategy is to lower the price below that of a seller who ignores the referral effect but not to offer rewards. 2 In an intermediate level of customer delight threshold, a seller should use a reward to complement a low-price strategy. As the delight threshold gets higher in this region, price should be higher and the rewards should be raised. 3 When the delight threshold is even higher, the seller should forsake the referral strategy all together. No rewards should be given, and price reverts back to that of a seller who ignores referrals. These results are consistent with the fact that referral rewards are not offered in all markets. Our analysis highlights the differences between lowering price and offering rewards as tools to motivate referrals. Lowering price is attractive because the seller "kills two birds with one stone": a lower price increases the probability of an initial purchase and the likelihood of referral. Unfortunately, a low price also creates a "free-riding" problem, because some customers benefit from the low price but do not refer other customers. Free riding becomes more severe with an increasing delight threshold; therefore, motivating referrals through low price is less attractive at high threshold levels. A referral reward helps to alleviate this problem, because of its "pay for performance" incentive only actual referrals are rewarded. Unfortunately, rewards can sometimes be given to customers who would have recommended anyway, causing a waste of company resources. The lower the delight threshold level, the bigger the waste and, therefore, motivating referrals through rewards loses attractiveness. Our theory highlights the advantage of using referral rewards in addition to lowering price to motivate referrals. It explains why referral programs are offered sometimes but not always and provides guidelines to managers on how to set the price and reward optimally.

304 citations

Journal ArticleDOI
TL;DR: In this article, the role of customers' social network in their defection from a service provider was explored, showing that exposure to a defecting neighbor is associated with an increase of 80% in the defection hazard, after controlling for a host of social, personal, and purchase related variables.
Abstract: This study explores the role of customers' social network in their defection from a service provider The authors use data on communication among one million customers of a cellular company to create a large-scale social system composed of customers' individual social networks The study's results indicate that exposure to a defecting neighbor is associated with an increase of 80% in the defection hazard, after controlling for a host of social, personal, and purchase-related variables This effect is comparable in both magnitude and nature to social effects observed in the highly researched case of product adoption: The extent of social influence on retention decays exponentially over time, and the likelihood of defection is affected by tie strength and homophily with defecting neighbors and by these neighbors' average number of connections Highly connected customers are more affected, and loyal customers are less affected by defections that occur in their social networks These results carry im

296 citations


Cited by
More filters
Proceedings ArticleDOI
24 Aug 2003
TL;DR: An analysis framework based on submodular functions shows that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models, and suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.
Abstract: Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of "word of mouth" in the promotion of new products. Recently, motivated by the design of viral marketing strategies, Domingos and Richardson posed a fundamental algorithmic problem for such social network processes: if we can try to convince a subset of individuals to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target?We consider this problem in several of the most widely studied models in social network analysis. The optimization problem of selecting the most influential nodes is NP-hard here, and we provide the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models; our framework suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.We also provide computational experiments on large collaboration networks, showing that in addition to their provable guarantees, our approximation algorithms significantly out-perform node-selection heuristics based on the well-studied notions of degree centrality and distance centrality from the field of social networks.

5,887 citations

Journal Article
TL;DR: The continuing convergence of the digital marketing and sales funnels has created a strategic continuum from digital lead generation to digital sales, which identifies the current composition of this digital continuum while providing opportunities to evaluate sales and marketing digital strategies.
Abstract: MKT 6009 Marketing Internship (0 semester credit hours) Student gains experience and improves skills through appropriate developmental work assignments in a real business environment. Student must identify and submit specific business learning objectives at the beginning of the semester. The student must demonstrate exposure to the managerial perspective via involvement or observation. At semester end, student prepares an oral or poster presentation, or a written paper reflecting on the work experience. Student performance is evaluated by the work supervisor. Pass/Fail only. Prerequisites: (MAS 6102 or MBA major) and department consent required. (0-0) S MKT 6244 Digital Marketing Strategy (2 semester credit hours) Executive Education Course. The course explores three distinct areas within marketing and sales namely, digital marketing, traditional sales prospecting, and executive sales organization and strategy. The continuing convergence of the digital marketing and sales funnels has created a strategic continuum from digital lead generation to digital sales. The course identifies the current composition of this digital continuum while providing opportunities to evaluate sales and marketing digital strategies. Prerequisites: MKT 6301 and instructor consent required. (2-0) Y MKT 6301 (SYSM 6318) Marketing Management (3 semester credit hours) Overview of marketing management methods, principles and concepts including product, pricing, promotion and distribution decisions as well as segmentation, targeting and positioning. (3-0) S MKT 6309 Marketing Data Analysis and Research (3 semester credit hours) Methods employed in market research and data analysis to understand consumer behavior, customer journeys, and markets so as to enable better decision-making. Topics include understanding different sources of data, survey design, experiments, and sampling plans. The course will cover the techniques used for market sizing estimation and forecasting. In addition, the course will cover the foundational concepts and techniques used in data visualization and \"story-telling\" for clients and management. Corequisites: MKT 6301 and OPRE 6301. (3-0) Y MKT 6310 Consumer Behavior (3 semester credit hours) An exposition of the theoretical perspectives of consumer behavior along with practical marketing implication. Study of psychological, sociological and behavioral findings and frameworks with reference to consumer decision-making. Topics will include the consumer decision-making model, individual determinants of consumer behavior and environmental influences on consumer behavior and their impact on marketing. Prerequisite: MKT 6301. (3-0) Y MKT 6321 Interactive and Digital Marketing (3 semester credit hours) Introduction to the theory and practice of interactive and digital marketing. Topics covered include: online-market research, consumer behavior, conversion metrics, and segmentation considerations; ecommerce, search and display advertising, audiences, search engine marketing, email, mobile, video, social networks, and the Internet of Things. (3-0) T MKT 6322 Internet Business Models (3 semester credit hours) Topics to be covered are: consumer behavior on the Internet, advertising on the Internet, competitive strategies, market research using the Internet, brand management, managing distribution and supply chains, pricing strategies, electronic payment systems, and developing virtual organizations. Further, students learn auction theory, web content design, and clickstream analysis. Prerequisite: MKT 6301. (3-0) Y MKT 6323 Database Marketing (3 semester credit hours) Techniques to analyze, interpret, and utilize marketing databases of customers to identify a firm's best customers, understanding their needs, and targeting communications and promotions to retain such customers. Topics

5,537 citations

Journal ArticleDOI
TL;DR: The problem of finding the most influential nodes in a social network is NP-hard as mentioned in this paper, and the first provable approximation guarantees for efficient algorithms were provided by Domingos et al. using an analysis framework based on submodular functions.
Abstract: Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technological innovations, the sudden and widespread adoption of various strategies in game-theoretic settings, and the effects of "word of mouth" in the promotion of new products. Recently, motivated by the design of viral marketing strategies, Domingos and Richardson posed a fundamental algorithmic problem for such social network processes: if we can try to convince a subset of individuals to adopt a new product or innovation, and the goal is to trigger a large cascade of further adoptions, which set of individuals should we target?We consider this problem in several of the most widely studied models in social network analysis. The optimization problem of selecting the most influential nodes is NP-hard here, and we provide the first provable approximation guarantees for efficient algorithms. Using an analysis framework based on submodular functions, we show that a natural greedy strategy obtains a solution that is provably within 63% of optimal for several classes of models; our framework suggests a general approach for reasoning about the performance guarantees of algorithms for these types of influence problems in social networks.We also provide computational experiments on large collaboration networks, showing that in addition to their provable guarantees, our approximation algorithms significantly out-perform node-selection heuristics based on the well-studied notions of degree centrality and distance centrality from the field of social networks.

4,390 citations

Journal ArticleDOI
TL;DR: In this article, the authors aim to develop a stronger understanding of customer experience and the customer journey in this era of increasingly complex customer behavior by examining existing definitions and conceptualizations of customer experiences as a construct.
Abstract: Understanding customer experience and the customer journey over time is critical for firms. Customers now interact with firms through myriad touch points in multiple channels and media, and customer experiences are more social in nature. These changes require firms to integrate multiple business functions, and even external partners, in creating and delivering positive customer experiences. In this article, the authors aim to develop a stronger understanding of customer experience and the customer journey in this era of increasingly complex customer behavior. To achieve this goal, they examine existing definitions and conceptualizations of customer experience as a construct and provide a historical perspective of the roots of customer experience within marketing. Next, they attempt to bring together what is currently known about customer experience, customer journeys, and customer experience management. Finally, they identify critical areas for future research on this important topic.

2,514 citations

Proceedings ArticleDOI
12 Aug 2007
TL;DR: This work exploits submodularity to develop an efficient algorithm that scales to large problems, achieving near optimal placements, while being 700 times faster than a simple greedy algorithm and achieving speedups and savings in storage of several orders of magnitude.
Abstract: Given a water distribution network, where should we place sensors toquickly detect contaminants? Or, which blogs should we read to avoid missing important stories?.These seemingly different problems share common structure: Outbreak detection can be modeled as selecting nodes (sensor locations, blogs) in a network, in order to detect the spreading of a virus or information asquickly as possible. We present a general methodology for near optimal sensor placement in these and related problems. We demonstrate that many realistic outbreak detection objectives (e.g., detection likelihood, population affected) exhibit the property of "submodularity". We exploit submodularity to develop an efficient algorithm that scales to large problems, achieving near optimal placements, while being 700 times faster than a simple greedy algorithm. We also derive online bounds on the quality of the placements obtained by any algorithm. Our algorithms and bounds also handle cases where nodes (sensor locations, blogs) have different costs.We evaluate our approach on several large real-world problems,including a model of a water distribution network from the EPA, andreal blog data. The obtained sensor placements are provably near optimal, providing a constant fraction of the optimal solution. We show that the approach scales, achieving speedups and savings in storage of several orders of magnitude. We also show how the approach leads to deeper insights in both applications, answering multicriteria trade-off, cost-sensitivity and generalization questions.

2,413 citations