activity
20092026
most citedOpinion fluctuations and disagreement in social networks

378 citations · 576 across the 50 of their papers we have counts for

collaborators
Showing cs.GTShow all

12 papers · 1 filter

cs.GT2026

Optimal Interventions on the Linear Threshold Model in Large-Scale Networks

Leonardo Cianfanelli, Sebastiano Messina, Giacomo Como +1

We study an optimal intervention problem on the linear threshold model (LTM) in which a social planner aims to design minimal-cost interventions that modify the agents' thresholds,…

cs.GT2025

On Signed Network Games with Binary Actions

Martina Vanelli, Laura Arditti, Giacomo Como +1

We study binary-action pairwise-separable graphical games that encompass both coordination and anti-coordination network games. Our model is grounded in an underlying directed sign…

cs.GT2025

Equilibria in Network Constrained Markets with System Operator

Giacomo Como, Fabio Fagnani, Leonardo Massai +1

We study a networked economic system composed of producers supplying a single homogeneous good to a number of geographically separated markets and of a centralized authority, c…

cs.GT2021

Equilibria and learning dynamics in mixed network coordination/anti-coordination games

Laura Arditti, Giacomo Como, Fabio Fagnani +1

Whilst network coordination games and network anti-coordination games have received a considerable amount of attention in the literature, network games with coexisting coordinating…

cs.GT2021

Robust Coordination of Linear Threshold Dynamics on Directed Weighted Networks

Laura Arditti, Giacomo Como, Fabio Fagnani +1

We study asynchronous dynamics in a network of interacting agents updating their binary states according to a time-varying threshold rule. Specifically, agents revise their state a…

cs.GT2020

Optimal Targeting in Super-Modular Games

Giacomo Como, Stéphane Durand, Fabio Fagnani

We study an optimal targeting problem for super-modular games with binary actions and finitely many players. The considered problem consists in the selection of a subset of players…

cs.GT2020

Robustness of Nash Equilibria in Network Games

Laura Arditti, Giacomo Como, Fabio Fagnani +1

We analyze the robustness of (pure strategy) Nash equilibria for network games against perturbations of the players' utility functions. We first derive a simple characterization of…

cs.GT2020★ 2 cited

Graphical Games and Decomposition

Laura Arditti, Giacomo Como, Fabio Fagnani

We consider graphical games as introduced by Kearns et al. (2001). First we analyse the interaction of graphicality with a notion of strategic equivalence of games, providing a min…

cs.GT2020★ 1 cited

Separable games

Laura Arditti, Giacomo Como, Fabio Fagnani

We present the notion of separable game with respect to a forward directed hypergraph (FDH-graph), which refines and generalizes that of graphical game. First, we show that there e…

cs.GT2019

Controlling network coordination games

Stephane Durand, Giacomo Como, Fabio Fagnani

We study a novel control problem in the context of network coordination games: the individuation of the smallest set of players capable of driving the system, globally, from one Na…

cs.GT2019

On games with coordinating and anti-coordinating agents

Martina Vanelli, Laura Arditti, Giacomo Como +1

This work studies Nash equilibria for games where a mixture of coordinating and anti-coordinating agents, with possibly heterogeneous thresholds, coexist and interact through an al…

cs.GT2016

A game theoretic approach to a peer-to-peer cloud storage model

Fabio Fagnani, Barbara Franci, Ennio Grasso

Classical cloud storage based on external data providers has been recognized to suffer from a number of drawbacks. This is due to its inherent centralized architecture which makes…