• Skip to main content
  • Skip to primary sidebar
AAAI

AAAI

Association for the Advancement of Artificial Intelligence

    • AAAI

      AAAI

      Association for the Advancement of Artificial Intelligence

  • About AAAIAbout AAAI
    • AAAI Officers and Committees
    • AAAI Staff
    • Bylaws of AAAI
    • AAAI Awards
      • Fellows Program
      • Classic Paper Award
      • Dissertation Award
      • Distinguished Service Award
      • Allen Newell Award
      • Outstanding Paper Award
      • Award for Artificial Intelligence for the Benefit of Humanity
      • Feigenbaum Prize
      • Patrick Henry Winston Outstanding Educator Award
      • Engelmore Award
      • AAAI ISEF Awards
      • Senior Member Status
      • Conference Awards
    • AAAI Resources
    • AAAI Mailing Lists
    • Past AAAI Presidential Addresses
    • Presidential Panel on Long-Term AI Futures
    • Past AAAI Policy Reports
      • A Report to ARPA on Twenty-First Century Intelligent Systems
      • The Role of Intelligent Systems in the National Information Infrastructure
    • AAAI Logos
    • News
  • aaai-icon_ethics-diversity-line-yellowEthics & Diversity
  • Conference talk bubbleConferences & Symposia
    • AAAI Conference
    • AIES AAAI/ACM
    • AIIDE
    • IAAI
    • ICWSM
    • HCOMP
    • Spring Symposia
    • Summer Symposia
    • Fall Symposia
    • Code of Conduct for Conferences and Events
  • PublicationsPublications
    • AAAI Press
    • AI Magazine
    • Conference Proceedings
    • AAAI Publication Policies & Guidelines
    • Request to Reproduce Copyrighted Materials
  • aaai-icon_ai-magazine-line-yellowAI Magazine
    • Issues and Articles
    • Author Guidelines
    • Editorial Focus
  • MembershipMembership
    • Member Login
    • Developing Country List
    • AAAI Chapter Program

  • Career CenterCareer Center
  • aaai-icon_ai-topics-line-yellowAITopics
  • aaai-icon_contact-line-yellowContact

Home / Proceedings / Proceedings of the AAAI Conference on Artificial Intelligence, 35 / No. 13: AAAI-21 Technical Tracks 13

Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback

February 1, 2023

Download PDF

Authors

Gianlorenzo D'Angelo

Gran Sasso Science Institute, L'Aquila, Italy


Debashmita Poddar

Gran Sasso Science Institute, L'Aquila, Italy


Cosimo Vinci

Gran Sasso Science Institute, L'Aquila, Italy


DOI:

10.1609/aaai.v35i13.17433


Abstract:

In the influence maximization (IM) problem, we are given a social network and a budget k, and we look for a set of k nodes in the network, called seeds, that maximize the expected number of nodes that are reached by an influence cascade generated by the seeds, according to some stochastic model for influence diffusion. Extensive studies have been done on the IM problem, since his definition by Kempe, Kleinberg, and Tardos (2003). However, most of the work focuses on the non-adaptive version of the problem where all the k seed nodes must be selected before that the cascade starts. In this paper we study the adaptive IM, where the nodes are selected sequentially one by one, and the decision on the i-th seed can be based on the observed cascade produced by the first i-1 seeds. We focus on the full-adoption feedback in which we can observe the entire cascade of each previously selected seed and on the independent cascade model where each edge is associated with an independent probability of diffusing influence. Previous works showed that there are constant upper bounds on the adaptivity gap, which compares the performance of an adaptive algorithm against a non-adaptive one, but the analyses used to prove these bounds only works for specific graph classes such as in-arborescences, out-arborescences, and one-directional bipartite graphs. Our main result is the first sub-linear upper bound that holds for any graph. Specifically, we show that the adaptivity gap is upper-bounded by ∛n+1, where n is the number of nodes in the graph. Moreover we improve over the known upper bound for in-arborescences from 2e/(e-1)≈3.16 to 2e²/(e²-1)≈2.31. Finally, we study α-bounded graphs, a class of undirected graphs in which the sum of node degrees higher than two is at most α, and show that the adaptivity gap is upper-bounded by √α+O(1). Moreover, we show that in 0-bounded graphs, i.e. undirected graphs in which each connected component is a path or a cycle, the adaptivity gap is at most 3e³/(e³-1)≈3.16. To prove our bounds, we introduce new techniques to relate adaptive policies with non-adaptive ones that might be of their own interest.

Topics: AAAI

Primary Sidebar

HOW TO CITE:

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback Proceedings of the AAAI Conference on Artificial Intelligence (2021) 12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback AAAI 2021, 12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci (2021). Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. Proceedings of the AAAI Conference on Artificial Intelligence, 12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci. Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. Proceedings of the AAAI Conference on Artificial Intelligence 2021 p.12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci. 2021. Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. "Proceedings of the AAAI Conference on Artificial Intelligence". 12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci. (2021) "Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback", Proceedings of the AAAI Conference on Artificial Intelligence, p.12069-12077

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci, "Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback", AAAI, p.12069-12077, 2021.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci. "Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback". Proceedings of the AAAI Conference on Artificial Intelligence, 2021, p.12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci. "Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback". Proceedings of the AAAI Conference on Artificial Intelligence, (2021): 12069-12077.

Gianlorenzo D'Angelo||Debashmita Poddar||Cosimo Vinci. Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback. AAAI[Internet]. 2021[cited 2023]; 12069-12077.


ISSN: 2374-3468


Published by AAAI Press, Palo Alto, California USA
Copyright 2022, Association for the Advancement of
Artificial Intelligence 1900 Embarcadero Road, Suite
101, Palo Alto, California 94303 All Rights Reserved

We use cookies on our website to give you the most relevant experience by remembering your preferences and repeat visits. By clicking “Accept All”, you consent to the use of ALL the cookies. However, you may visit "Cookie Settings" to provide a controlled consent.
Cookie SettingsAccept All
Manage consent

Privacy Overview

This website uses cookies to improve your experience while you navigate through the website. Out of these, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may affect your browsing experience.
Necessary
Always Enabled
Necessary cookies are absolutely essential for the website to function properly. These cookies ensure basic functionalities and security features of the website, anonymously.
CookieDurationDescription
cookielawinfo-checkbox-analytics11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Analytics".
cookielawinfo-checkbox-functional11 monthsThe cookie is set by GDPR cookie consent to record the user consent for the cookies in the category "Functional".
cookielawinfo-checkbox-necessary11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookies is used to store the user consent for the cookies in the category "Necessary".
cookielawinfo-checkbox-others11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Other.
cookielawinfo-checkbox-performance11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Performance".
viewed_cookie_policy11 monthsThe cookie is set by the GDPR Cookie Consent plugin and is used to store whether or not user has consented to the use of cookies. It does not store any personal data.
Functional
Functional cookies help to perform certain functionalities like sharing the content of the website on social media platforms, collect feedbacks, and other third-party features.
Performance
Performance cookies are used to understand and analyze the key performance indexes of the website which helps in delivering a better user experience for the visitors.
Analytics
Analytical cookies are used to understand how visitors interact with the website. These cookies help provide information on metrics the number of visitors, bounce rate, traffic source, etc.
Advertisement
Advertisement cookies are used to provide visitors with relevant ads and marketing campaigns. These cookies track visitors across websites and collect information to provide customized ads.
Others
Other uncategorized cookies are those that are being analyzed and have not been classified into a category as yet.
SAVE & ACCEPT