### Abstract

Reasoning about social networks (labeled, directed, weighted graphs) is be- coming increasingly important and there are now models of how certain phenomena (e.g. adoption of products/services by consumers, spread of a given disease) "diffuuse" through the network. Some of these diffusion models can be expressed via generalized annotated programs (GAPs). In this paper, we consider the following problem: suppose we have a given goal to achieve (e.g. maximize the expected number of adoptees of a product or minimize the spread of a disease) and suppose we have limited resources to use in trying to achieve the goal (e.g. give out a few free plans, provide medication to key people in the SN) - how should these resources be used so that we optimize a given objective function related to the goal? We define a class of social network optimization problems (SNOPs) that supports this type of reasoning. We formalize and study the complexity of SNOPs and show how they can be used in conjunction with existing economic and disease diffusion models.

Original language | English (US) |
---|---|

Title of host publication | Leibniz International Proceedings in Informatics, LIPIcs |

Pages | 182-191 |

Number of pages | 10 |

Volume | 7 |

DOIs | |

State | Published - 2010 |

Externally published | Yes |

Event | 26th International Conference on Logic Programming, ICLP 2010 - Edinburgh, United Kingdom Duration: Jul 16 2010 → Jul 19 2010 |

### Other

Other | 26th International Conference on Logic Programming, ICLP 2010 |
---|---|

Country | United Kingdom |

City | Edinburgh |

Period | 7/16/10 → 7/19/10 |

### Fingerprint

### ASJC Scopus subject areas

- Software
- Logic

### Cite this

*Leibniz International Proceedings in Informatics, LIPIcs*(Vol. 7, pp. 182-191) https://doi.org/10.4230/LIPIcs.ICLP.2010.182

**Using generalized annotated programs to solve social network optimization problems.** / Shakarian, Paulo; Subrahmanian, V. S.; Sapino, Maria Luisa.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Leibniz International Proceedings in Informatics, LIPIcs.*vol. 7, pp. 182-191, 26th International Conference on Logic Programming, ICLP 2010, Edinburgh, United Kingdom, 7/16/10. https://doi.org/10.4230/LIPIcs.ICLP.2010.182

}

TY - GEN

T1 - Using generalized annotated programs to solve social network optimization problems

AU - Shakarian, Paulo

AU - Subrahmanian, V. S.

AU - Sapino, Maria Luisa

PY - 2010

Y1 - 2010

N2 - Reasoning about social networks (labeled, directed, weighted graphs) is be- coming increasingly important and there are now models of how certain phenomena (e.g. adoption of products/services by consumers, spread of a given disease) "diffuuse" through the network. Some of these diffusion models can be expressed via generalized annotated programs (GAPs). In this paper, we consider the following problem: suppose we have a given goal to achieve (e.g. maximize the expected number of adoptees of a product or minimize the spread of a disease) and suppose we have limited resources to use in trying to achieve the goal (e.g. give out a few free plans, provide medication to key people in the SN) - how should these resources be used so that we optimize a given objective function related to the goal? We define a class of social network optimization problems (SNOPs) that supports this type of reasoning. We formalize and study the complexity of SNOPs and show how they can be used in conjunction with existing economic and disease diffusion models.

AB - Reasoning about social networks (labeled, directed, weighted graphs) is be- coming increasingly important and there are now models of how certain phenomena (e.g. adoption of products/services by consumers, spread of a given disease) "diffuuse" through the network. Some of these diffusion models can be expressed via generalized annotated programs (GAPs). In this paper, we consider the following problem: suppose we have a given goal to achieve (e.g. maximize the expected number of adoptees of a product or minimize the spread of a disease) and suppose we have limited resources to use in trying to achieve the goal (e.g. give out a few free plans, provide medication to key people in the SN) - how should these resources be used so that we optimize a given objective function related to the goal? We define a class of social network optimization problems (SNOPs) that supports this type of reasoning. We formalize and study the complexity of SNOPs and show how they can be used in conjunction with existing economic and disease diffusion models.

UR - http://www.scopus.com/inward/record.url?scp=84880202202&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880202202&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ICLP.2010.182

DO - 10.4230/LIPIcs.ICLP.2010.182

M3 - Conference contribution

AN - SCOPUS:84880202202

SN - 9783939897170

VL - 7

SP - 182

EP - 191

BT - Leibniz International Proceedings in Informatics, LIPIcs

ER -