Information spread in social networks through scheduling seeding methods

A method for information spread in one or more social networks, the method comprises:

• receiving or generating social network information that represents members of the one or more social networks and links between the members;
• repeating, for each point in time out of multiple points in time, the steps of:
• determining, in response to budget constraints and current statuses of the members, at least one target member that is non-infected during the point of time and should be infected before the next point in time or in later points in time, to provide an increase in a number of infected members;
• wherein the statuses of the members comprises (i) infected and infectious, (ii) non-infected and (iii) infected and non-infectious;
• and
• sending, at a cost, the information to the at least one target member, before the next point in time.

A non-transitory computer readable medium that stores instructions that once executed by a computer cause the computer to execute the steps of:

• receiving or generating social network information that represents members of the one or more social networks and links between the members;
• repeating, for each point in time out of multiple points in time, the steps of:
• determining, in response to budget constraints and current statuses of the members, at least one target member that is non-infected during the point of time and should be infected before the next point in time, to provide a maximal number of infected members;
• wherein the statuses of the members comprises (i) infected and infectious, (ii) non-infected and (iii) infected and non-infectious;
• and
• sending, at a cost, the information to the at least one target member, before the next point in time.