New Models for Competitive Contagion

Authors: Moez Draief, Hoda Heidari, Michael Kearns

AAAI 2014 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical In this paper, we introduce and examine two new models for competitive contagion in networks... For a general class of stochastic dynamics driving the local adoption process, we derive upper bounds on (1) the (pure strategy) Price of Anarchy (Po A)... and (2) the Budget Multiplier... We also introduce a model in which budgeting decisions are endogenous... In sharp contrast to the results of Goyal and Kearns, we show that for almost any local adoption dynamics, there exists a family of graphs for which the Po A and Budget Multiplier are unbounded.
Researcher Affiliation Academia Moez Draief Electrical and Electronic Engineering Imperial College m.draief@imperial.ac.uk Hoda Heidari Computer and Information Science University of Pennsylvania hoda@seas.upenn.edu Michael Kearns Computer and Information Science University of Pennsylvania mkearns@cis.upenn.edu
Pseudocode No The paper describes models and proofs but does not include any pseudocode or algorithm blocks.
Open Source Code No The paper does not provide any information about open-source code for the described methodology.
Open Datasets No This is a theoretical paper and does not involve training data or empirical experiments.
Dataset Splits No This is a theoretical paper and does not involve validation datasets or empirical experiments.
Hardware Specification No This is a theoretical paper and does not mention any hardware specifications used for experiments.
Software Dependencies No This is a theoretical paper and does not mention specific software dependencies with version numbers.
Experiment Setup No This is a theoretical paper and does not describe an experimental setup with hyperparameters or system-level training settings.