Related papers: Maximal Information Propagation with Budgets

A digital security breach, by which confidential information is leaked, does not only affect the agent whose system is infiltrated, but is also detrimental to other agents socially connected to the infiltrated system. Although it has been…

Information, ideas, and diseases, or more generally, contagions, spread over space and time through individual transmissions via social networks, as well as through external sources. A detailed picture of any diffusion process can be…

We introduce a model of information dissemination in signed networks. It is a discrete-time process in which uninformed actors incrementally receive information from their informed neighbors or from the outside. Our goal is to minimize the…

Purpose: We propose a model to present a possible mechanism for obtaining sizeable behavioural structures by simulating an agent based on the evolutionary public good game with available social learning. Methods: The model considered a…

We consider a group of neighboring smartphone users who are roughly at the same time interested in the same network content, called common interests. However, ever-increasing data traffic challenges the limited capacity of base-stations…

In a social network, even about the same information the excitements between different pairs of users are different. If you want to spread a piece of new information and maximize the expected total amount of excitements, which seed users…

The buying and selling of information is taking place at a scale unprecedented in the history of commerce, thanks to the formation of online marketplaces for user data. Data providing agencies sell user information to advertisers to allow…

The goal of opinion maximization is to maximize the positive view towards a product, an ideology or any entity among the individuals in social networks. So far, opinion maximization is mainly studied as finding a set of influential nodes…

Designing auctions to incentivize buyers to invite new buyers via their social connections is a new trend in mechanism design. The challenge is that buyers are competitors and we need to design proper incentives for them to invite each…

Competition among news sources may encourage some sources to share fake news and misinformation to influence the public. While sharing misinformation may lead to a short-term gain in audience engagement, it may damage the reputation of…

In this paper, we study the problem of allocating ads to users through the viral-marketing lens. Advertisers approach the host with a budget in return for the marketing campaign service provided by the host. We show that allocation that…

We study a cost sharing problem derived from bug bounty programs, where agents gain utility by the amount of time they get to enjoy the cost shared information. Once the information is provided to an agent, it cannot be retracted. The goal,…

Firms (businesses, service providers, entertainment organizations, political parties, etc.) advertise on social networks to draw people's attention and improve their awareness of the brands of the firms. In all such cases, the competitive…

We introduce a new budgeted framework for online influence maximization, considering the total cost of an advertising campaign instead of the common cardinality constraint on a chosen influencer set. Our approach better models the…

We study proliferation of an action in binary action network coordination games that are generalized to include global effects. This captures important aspects of proliferation of a particular action or narrative in online social networks,…

In imperfect information games (e.g. Bridge, Skat, Poker), one of the fundamental considerations is to infer the missing information while at the same time avoiding the disclosure of private information. Disregarding the issue of protecting…

Network creation games have been extensively studied, both from economists and computer scientists, due to their versatility in modeling individual-based community formation processes, which in turn are the theoretical counterpart of…

We study fairness in social influence maximization, whereby one seeks to select seeds that spread a given information throughout a network, ensuring balanced outreach among different communities (e.g. demographic groups). In the literature,…

Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players or nodes each of whom has a budget for purchasing links; each…

Mechanisms such as auctions and pricing schemes are utilized to design strategic (noncooperative) games for networked systems. Although the participating players are selfish, these mechanisms ensure that the game outcome is optimal with…