Embedded Files
Prof. Gianlorenzo D'Angelo (Principal Investigator).
List of Publications:
“Election Control Through Social Influence with Unknown Preferences”
M. Abouei Mehrizi, F. Corò, E. Cruciani, G. D'Angelo.
COCOON 2020 (link)
“Models and Algorithms for Election Control through Influence Maximization”
M. Abouei Mehrizi, F. Corò, E. Cruciani, G. D'Angelo, S. Ponziani.
ICTCS 2019 (link)
“Multi-Winner Election Control via Social Influence: Hardness and Algorithms for Restricted Cases”
M. Abouei Mehrizi, G. D'Angelo
Algorithms (link)
“Multi-winner Election Control via Social Influence”
M. Abouei Mehrizi, G. D'Angelo
SIROCCO 2020 (link)
“The Impact of Selfishness in Hypergraph Hedonic Games”
A. Aloisio, M. Flammini, C. Vinci
AAAI 2020 (link)
“Distance Polymatrix Coordination Games”
A. Aloisio, M. Flammini, B. Kodric, C. Vinci
IJCAI 2021 (link)
“Group-Harmonic and Group-Closeness Maximization - Approximation and Engineering”
E. Angriman, R. Becker, G. D'Angelo, H. Gilbert, A. van der Grinten, H. Meyerhenke
ALENEX 2021 (link)
“On Non-cooperativeness in Social Distance Games"
A. Balliu, M. Flammini, G. Melideo, D. Olivetti
Journal of Artificial Intelligence Research (link)
"Data-Driven Models of Selfish Routing: Why Price of Anarchy Does Depend on Network Topology"
F. Benita, V. Bilò, B. Monnot, G. Piliouras, C. Vinci
WINE 2020 (link)
“Fairness in Influence Maximization through Randomization”
R. Becker, G. D’Angelo, S. Ghobadi, Hugo Gilbert
AAAI 2021 (link)
“Balancing Spreads of Influence in a Social Network”
R. Becker, F. Corò, G. D’Angelo, Hugo Gilbert.
AAAI 2020 (link)
“Maximizing Influence-Based Group Shapley Centrality”
R. Becker, G. D’Angelo, Hugo Gilbert
AAMAS 2021 (link)
“On Multidimensional Congestion Games”
Vittorio Bilò, Michele Flammini, Vasco Gallotti, Cosimo Vinci
Algorithms (link)
"Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems"
V. Bilò, A. Fanelli, M. Flammini, Gianpiero Monaco, Luca Moscardelli
IJCAI 2019 (link)
“The Quality of Content Publishing in the Digital Era”
V. Bilò, M. Flammini, C. Vinci
ECAI 2020 (link)
“Nash Social Welfare in Selfish and Online Load Balancing”
V. Bilò, G. Monaco, L. Moscardelli, C. Vinci
WINE 2020 (link)
“Congestion Games with Priority-Based Scheduling”
V. Bilò, C. Vinci
SAGT 2020 (link)
“The Price of Anarchy of Affine Congestion Games with Similar Strategies”
V. Bilò, C. Vinci
Theoretical Computer Science (link)
“The Multi-budget Maximum Weighted Coverage Problem”
F. Cellinese, G. D'Angelo, G. Monaco, Y. Velaj
CIAC 2021 (link)
“Generalized budgeted submodular set function maximization”
F. Cellinese, G. D'Angelo, G. Monaco, Y. Velaj
Information and Computation (link)
“Exploiting Social Influence to Control Elections Based on Scoring Rules”
F. Corò, E. Cruciani, G. D’Angelo, S. Ponziani
IJCAI 2019 (link)
“On the Fixed-Parameter Tractability of the Maximum Connectivity Improvement Problem”
F. Corò, G. D’Angelo, V. Mkrtchyan
Theory of Computing Systems (link)
“Adding Edges for Maximizing Weighted Reachability”
F. Corò, G. D’Angelo, C. M. Pinotti
Algorithms (link)
“Link Recommendation for Social Influence Maximization”
F. Corò, G. D’Angelo, Y. Velaj
ACM Trans. Knowl. Discov. Data (link)
“Recommending Links to Maximize the Influence in Social Networks”
F. Corò, G. D’Angelo, Y. Velaj
IJCAI 2019 (link)
“Recommending Links to Control Elections via Social Influence”
F. Corò, G. D'Angelo, Y. Velaj
Algorithms (link)
“Leader Election and Compaction for Asynchronous Silent Programmable Matter”
G. D’Angelo, S. Das, M. D’Emidio, A. Navarra, and G. Prencipe
AAMAS 2020 (link)
“Asynchronous Silent Programmable Matter Achieves Leader Election and Compaction”
G. D’Angelo, S. Das, M. D’Emidio, A. Navarra, and G. Prencipe
IEEE Access (link)
“Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback”
G. D’Angelo, D. Poddar, C. Vinci
AAAI 2021 (link)
“Improved Approximation Factor for Adaptive Influence Maximization via Simple Greedy Strategies”
G. D’Angelo, D. Poddar, C. Vinci
ICALP 2021 (link)
“Price of Pareto Optimality in Hedonic Games”
E. Elkind, A. Fanelli, M. Flammini
Artificial Intelligence (link)
“Parameterized Complexity of Manipulating Sequential Allocation”
M. Flammini, H. Gilbert
ECAI 2020 (link)
“Strategyproof Mechanisms for Friends and Enemies Games”
M. Flammini, B. Kodric, G. Varricchio
AAAI 2020 (link)
“Strategyproof Mechanisms for Friends and Enemies Games”
M. Flammini, B. Kodric, G. Varricchio
Artificial Intelligence (to appear) (link not yet available)
"Strategyproof Mechanisms for Additively Separable and Fractional Hedonic Games"
Michele Flammini, Bojana Kodric, Gianpiero Monaco, Qiang Zhang
Journal of Artificial Intelligence Research (link)
“Distance hedonic games” (extended abstract)
M. Flammini, B. Kodric, M. Olsen, G. Varricchio
AAMAS 2020 (link)
“Distance hedonic games”
M. Flammini, B. Kodric, M. Olsen, G. Varricchio
SOFSEM 2021 (link)
“On fair price discrimination in multi-unit markets"
M. Flammini, M. Mauro, M. Tonelli,
Artificial Intelligence (link)
“Inequity Aversion Pricing in Multi-Unit Markets”
M. Flammini, M. Mauro, M. Tonelli, Cosimo Vinci
ECAI 2020 (link)
Page updated
Report abuse