### 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 | Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010 |

Pages | 182-191 |

Number of pages | 10 |

DOIs | |

State | Published - 2010 |

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

### Publication series

Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|

Volume | 7 |

ISSN (Print) | 1868-8969 |

### Other

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

Country | United Kingdom |

City | Edinburgh |

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

### ASJC Scopus subject areas

- Software

## Fingerprint Dive into the research topics of 'Using generalized annotated programs to solve social network optimization problems'. Together they form a unique fingerprint.

## Cite this

*Technical Communications of the 26th International Conference on Logic Programming, ICLP 2010*(pp. 182-191). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 7). https://doi.org/10.4230/LIPIcs.ICLP.2010.182