Better bounds on the adaptivity gap of influence maximization under full-adoption feedback

, &
Artificial Intelligence 318 (C):103895 (2023)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2023.103895

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Regret minimization in online Bayesian persuasion: Handling adversarial receiver's types under full and partial feedback models.Matteo Castiglioni, Andrea Celli, Alberto Marchesi & Nicola Gatti - 2023 - Artificial Intelligence 314 (C):103821.
Constraint propagation as information maximization.A. Nait Abdallah & M. H. van Emden - 2013 - Artificial Intelligence 197 (C):25-38.
Cooperative hierarchical Dirichlet processes: Superposition vs. maximization.Junyu Xuan, Jie Lu & Guangquan Zhang - 2019 - Artificial Intelligence 271 (C):43-73.
Exploratory analysis of speedup learning data using expectation maximization.Alberto Maria Segre, Geoffrey J. Gordon & Charles P. Elkan - 1996 - Artificial Intelligence 85 (1-2):301-319.
Exploratory analysis of speedup learning data using expectation maximization.A. M. Segre & G. J. Elkan - 1996 - Artificial Intelligence 84 (1-2):358.
Dynamically improved bounds bidirectional search.E. C. Sewell & S. H. Jacobson - 2021 - Artificial Intelligence 291 (C):103405.
Performance bounds for planning in unknown terrain.Sven Koenig, Craig Tovey & Yuri Smirnov - 2003 - Artificial Intelligence 147 (1-2):253-279.
On the computational complexity of querying bounds on differences constraints.Vittorio Brusoni, Luca Console & Paolo Terenziani - 1995 - Artificial Intelligence 74 (2):367-379.
Algorithms and conditional lower bounds for planning problems.Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger & Alexander Svozil - 2021 - Artificial Intelligence 297 (C):103499.
Optimal query complexity bounds for finding graphs.Sung-Soon Choi & Jeong Han Kim - 2010 - Artificial Intelligence 174 (9-10):551-569.

Analytics

Added to PP
2023-03-11

Downloads
6 (#1,482,377)

6 months
3 (#1,208,233)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references