378 citations · 576 across the 50 of their papers we have counts for
15 papers · 1 filter
Intervention problems in the Linear Threshold Model: A general formulation and new results
Giacomo Como, Fabio Fagnani, Stephane Durand
We study an optimal intervention problem for linear threshold models. This is a popular class of dynamical network systems whereby a number of agents, identified with the nodes of…
Wisdom of Crowds Through Myopic Self-Confidence Adaptation
Giacomo Como, Fabio Fagnani, Anton Proskurnikov
The wisdom of crowds is an umbrella term for phenomena suggesting that the collective judgment or decision of a large group can be more accurate than the individual judgments or de…
How competitive are pay-as-bid auction games?
Martina Vanelli, Giacomo Como, Fabio Fagnani
We study the pay-as-bid auction game, a supply function model with discriminatory pricing and asymmetric firms. In this game, strategies are non-decreasing supply functions relatin…
Optimal selection of the most informative nodes for a noisy DeGroot model with stubborn agents
Roberta Raineri, Giacomo Como, Fabio Fagnani
Finding the optimal subset of individuals to observe in order to obtain the best estimate of the average opinion of a society is a crucial problem in a wide range of applications,…
Reaching optimal distributed estimation through myopic self-confidence adaptation
Giacomo Como, Fabio Fagnani, Anton V. Proskurnikov
Consider discrete-time linear distributed averaging dynamics, whereby agents in a network start with uncorrelated and unbiased noisy measurements of a common underlying parameter (…
Systemic risk and network intervention
Luca Damonte, Giacomo Como, Fabio Fagnani
We consider a novel adversarial shock/protection problem for a class of network equilibria models emerging from a variety of different fields as continuous network games, productio…
A game theoretic approach to a network allocation problem
Barbara Franci, Fabio Fagnani
In this paper, we consider a network allocation problem motivated by peer-to-peer cloud storage models. The setting is that of a network of units (e.g. computers) that collaborate…
Note on "Average resistance of toroidal graphs" by Rossi, Frasca and Fagnani
Wilbert Samuel Rossi, Paolo Frasca, Fabio Fagnani
In our recent paper W.S. Rossi, P. Frasca and F. Fagnani, "Average resistance of toroidal graphs", SIAM Journal on Control and Optimization, 53(4):2541--2557, 2015, we studied how…
A game theoretic approach to a network cloud storage problem
Fabio Fagnani, Barbara Franci
The use of game theory in the design and control of large scale networked systems is becoming increasingly more important. In this paper, we follow this approach to efficiently sol…
Message passing optimization of Harmonic Influence Centrality
Luca Vassio, Fabio Fagnani, Paolo Frasca +1
This paper proposes a new measure of node centrality in social networks, the Harmonic Influence Centrality, which emerges naturally in the study of social influence over networks.…
Average resistance of toroidal graphs
Wilbert Samuel Rossi, Paolo Frasca, Fabio Fagnani
The average effective resistance of a graph is a relevant performance index in many applications, including distributed estimation and control of network systems. In this paper, we…
The asymptotical error of broadcast gossip averaging algorithms
Paolo Frasca, Fabio Fagnani
In problems of estimation and control which involve a network, efficient distributed computation of averages is a key issue. This paper presents theoretical and simulation results…
Broadcast gossip averaging algorithms: interference and asymptotical error in large networks
Paolo Frasca, Fabio Fagnani
In this paper we study two related iterative randomized algorithms for distributed computation of averages. The first one is the recently proposed Broadcast Gossip Algorithm, in wh…
Gossip consensus algorithms via quantized communication
Ruggero Carli, Fabio Fagnani, Paolo Frasca +1
This paper considers the average consensus problem on a network of digital links, and proposes a set of algorithms based on pairwise ''gossip'' communications and updates. We study…
Efficient quantization for average consensus
Ruggero Carli, Fabio Fagnani, Paolo Frasca +1
This paper presents an algorithm which solves exponentially fast the average consensus problem on strongly connected network of digital links. The algorithm is based on an efficien…