Using generalized annotated programs to solve social network optimization problems

Paulo Shakarian, V. S. Subrahmanian, Maria Luisa Sapino

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationLeibniz International Proceedings in Informatics, LIPIcs
Pages182-191
Number of pages10
Volume7
DOIs
StatePublished - 2010
Externally publishedYes
Event26th International Conference on Logic Programming, ICLP 2010 - Edinburgh, United Kingdom
Duration: Jul 16 2010Jul 19 2010

Other

Other26th International Conference on Logic Programming, ICLP 2010
CountryUnited Kingdom
CityEdinburgh
Period7/16/107/19/10

Fingerprint

Network Optimization
Social Networks
Diffusion Model
Optimization Problem
Reasoning
Resources
Directed graphs
Weighted Graph
Objective function
Maximise
Optimise
Economics
Minimise
Model

ASJC Scopus subject areas

  • Software
  • Logic

Cite this

Shakarian, P., Subrahmanian, V. S., & Sapino, M. L. (2010). Using generalized annotated programs to solve social network optimization problems. In 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.

Leibniz International Proceedings in Informatics, LIPIcs. Vol. 7 2010. p. 182-191.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Shakarian, P, Subrahmanian, VS & Sapino, ML 2010, Using generalized annotated programs to solve social network optimization problems. in 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
Shakarian P, Subrahmanian VS, Sapino ML. Using generalized annotated programs to solve social network optimization problems. In Leibniz International Proceedings in Informatics, LIPIcs. Vol. 7. 2010. p. 182-191 https://doi.org/10.4230/LIPIcs.ICLP.2010.182
Shakarian, Paulo ; Subrahmanian, V. S. ; Sapino, Maria Luisa. / Using generalized annotated programs to solve social network optimization problems. Leibniz International Proceedings in Informatics, LIPIcs. Vol. 7 2010. pp. 182-191
@inproceedings{15b3f68dfce4414285aeb413b4de2df2,
title = "Using generalized annotated programs to solve social network optimization problems",
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.",
author = "Paulo Shakarian and Subrahmanian, {V. S.} and Sapino, {Maria Luisa}",
year = "2010",
doi = "10.4230/LIPIcs.ICLP.2010.182",
language = "English (US)",
isbn = "9783939897170",
volume = "7",
pages = "182--191",
booktitle = "Leibniz International Proceedings in Informatics, LIPIcs",

}

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 -