Show simple item record

dc.contributor.advisorNarahari, Y
dc.contributor.authorDayama, Pankaj
dc.date.accessioned2018-08-02T06:20:43Z
dc.date.accessioned2018-08-28T11:31:32Z
dc.date.available2018-08-02T06:20:43Z
dc.date.available2018-08-28T11:31:32Z
dc.date.issued2018-08-02
dc.date.submitted2015
dc.identifier.urihttps://etd.iisc.ac.in/handle/2005/3992
dc.identifier.abstracthttp://etd.iisc.ac.in/static/etd/abstracts/4800/G27167-Abs.pdfen_US
dc.description.abstractThis work is motivated by several modern applications involving social networks, crowds, and markets. Our work focuses on the theme of designing effective incentive strategies for these applications. Viral marketing is receiving much attention by practicing marketers and researchers alike. While not a new idea, it has come to the forefront because of multiple effects – products have become more complex, making buyers to increasingly rely on opinions of their peers; consumers have evolved to distrust advertising; and Web2.0 has revolutionized the way people can connect, communicate and share. With power shifting to consumers, it has become important for companies to devise effective viral marketing strategies. Incentives are also a critical aspect of crowd sourcing tasks and play a crucial role in attracting, motivating and sustaining participation. The thesis addresses the following problems. (i) Optimal Control of Information Epidemics: We address two problems concerning information propagation in a population: a) how to maximize the spread of a given message in the population within the stipulated time and b) how to create a given level of buzz- measured by the fraction of the population engaged in conversation on a topic of interest- at a specified time horizon. (ii) Optimal Control Strategies for Social Influence (SI) Marketing: We investigate four SI strategies, namely, recommendation programs, referral programs, consumer reviews and campaigns on on-line forums. The campaign is assumed to be of finite duration, and the objective is to maximize profit, the (un-discounted) revenue minus the expenditure on the SI strategy under consideration, over the campaign duration. For each SI strategy, we focus on its timing, i.e., determining at what times to execute it. We address two important questions pertaining to them: a) how to execute a given SI strategy optimally? and b) having executed it so, what gains does it lead to? (iii) Optimal Mix of Incentive Strategies on Social Networks: The reach of a product in a pop- ulation can be influenced by offering (a) direct incentives to influence the buying behavior of potential buyers and (b) referral rewards to exploit the impact of social influence in inducing a purchasing decision. The company is interested in an optimal mix of these incentive programs. We report results on structure of optimal strategies for the company with significant practical implications. (iv) Truthful Tractable Mechanisms with Applications to Crowd sourcing: We focus on crowd- sourcing applications that involve specialized tasks for which the planner hardly has any idea about crowdworkers’ costs, for example, tagging geographical regions with air pollution levels or severity level of Ebola like disease. The mechanisms have to be robust to untruthful bidding from the crowdworkers. In our work, we propose tractable allocation algorithms that are monotone, leading to design of truthful mechanisms that can be successfully deployed in such applications.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesG27167en_US
dc.subjectComputer Communication Networken_US
dc.subjectInternet (World Wide Web)en_US
dc.subjectSocial Networken_US
dc.subjectInternet Marketing Strategiesen_US
dc.subjectOptimal Control Theoryen_US
dc.subjectPontryagin’s Maximum Prinicipleen_US
dc.subjectSocial Influence Marketing1en_US
dc.subjectCrowdsourcingen_US
dc.subject.classificationComputer Scienceen_US
dc.titleIncentive Strategies and Algorithms for Networks, Crowds and Marketsen_US
dc.typeThesisen_US
dc.degree.namePhDen_US
dc.degree.levelDoctoralen_US
dc.degree.disciplineFaculty of Engineeringen_US


Files in this item

This item appears in the following Collection(s)

Show simple item record