Filetype
Whilst network coordination games and network anti-coordination games have received a considerable amount of attention in the literature, network games with coexisting coordinating and anti-coordinating players are known to exhibit more complex behaviors. In fact, depending on the network structure, such games may even fail to have pure-strategy Nash equilibria. An example is represented by the we
We study extensions of the classical SIR model of epidemic spread. First, we consider a single population modified SIR epidemics model in which the contact rate is allowed to be an arbitrary function of the fraction of susceptible and infected individuals. This allows one to model either the reaction of individuals to the information about the spread of the disease or the result of government rest
We study deterministic continuous-time lossy dynamical flow networks with constant exogenous demands, fixed routing, and finite flow and buffer capacities. In the considered model, when the total net flow in a cell —consisting of the difference between the total flow directed towards it minus the outflow from it— exceeds a certain capacity constraint, then the exceeding part of it leaks out of the
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 Nash equilibrium to another one. Our main contribution is the design of a randomized algorithm based on a time-reversible Markov chain with provable convergence guarantees.
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, production networks, opinion dynamic models. The problem is casted into a min-max problem and analytically solved for two particular cases of aggregate performances: the mean square of the equilibrium or of its arithmetic mean. T
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 all-to-all network. Whilst games with only coordinating or only anti-coordinating agents are potential, also in the presence of heterogeneities, this does not hold when both type of agents are simultaneously present. This
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 of minimum size such that, when the actions of these players are forced to a controlled value while the others are left to repeatedly play a best response action, the system will converge to the greatest Nash equilibriu
We undertake a fundamental study of network equilibria modeled as solutions of fixed-point equations for monotone linear functions with saturation nonlinearities. The considered model extends one originally proposed to study systemic risk in networks of financial institutions interconnected by mutual obligations. It is one of the simplest continuous models accounting for shock propagation phenomen
We study transportation networks controlled by dynamic feedback tolls. We focus on a multiscale model, whereby the dynamics of the traffic flows are intertwined with those of the routing choices. The latter are influenced by the current traffic state of the network as well as by dynamic tolls controlled in feedback by the system planner. We prove that a class of decentralized monotone flow-depende
Cell-free Massive MIMO systems consist of a large number of geographically distributed access points (APs) that serve the users by coherent joint transmission. The spectral efficiency (SE) achieved by each user depends on the power allocation: which APs that transmit to which users and with what power. In this article, we revisit the max-min and sum-SE power allocation policies, which have previou
Cell-free massive MIMO systems consist of many distributed access points with simple components that jointly serve the users. In millimeter wave bands, only a limited set of predetermined beams can be supported. In a network that consolidates these technologies, downlink analog beam selection stands as a challenging task for the network sum-rate maximization. Low-cost digital filters can improve t
Camera sensor networks, mainly with surveillance cameras, are growing in size and complexity. Storage space is the prime resource in such systems but current surveillance setups are still very much centralized and limited in resources due to cost and security constraints. Allocating the correct amount of storage to each camera sensor considering their large difference in characteristics and video
The lack of methods to evaluate mechanical function of donated hearts in the context of transplantation imposes large precautionary margins, translating into a low utilization rate of donor organs. This has spawned research into cyber-physical models constituting artificial afterloads (arterial trees), that can serve to evaluate the contractile capacity of the donor heart. The Windkessel model is
The lack of methods to evaluate mechanical function of donated hearts in the context of transplantation imposes large precautionary margins, translating into a low utilization rate of donor organs. This has spawned research into cyber-physical models constituting artificial afterloads (arterial trees), that can serve to evaluate the contractile capacity of the donor heart.The Windkessel model is a
A 2.2 mm2 full digital baseband SoC with four heterogeneous cores for 128-node 8-users distributed massive MIMO is presented. Two specialized DSPs perform rapid over-the-air synchronization within 0.1ms. A highly optimized 8-complex lane MIMO vector processor provides 4x hardware efficiency improvement over general-purpose processors. Circuit optimizations and the use of body-bias result in 1070 p
This paper focuses on the computation of the joint spectral radius (JSR), when the involved matrices are sparse. We provide a sparse variant of the procedure proposed by Parrilo and Jadbabaie to compute upper bounds of the JSR by means of sum-of-squares (SOS) programming. Our resulting iterative algorithm, called SparseJSR, is based on the term sparsity SOS (TSSOS) framework developed by Wang, Mag
The field of robotics offers a wide array of estimation problems, ranging from kinematic and dynamic calibration to pose estimation and computer vision. This thesis presents a set of methods to solve estimation problems encountered in robotics, with an emphasis on industrial robotics. The researched topics are all practically motivated and have found immediate use in applications.Industrial roboti
Online 3D reconstruction has been an active research area for a long time. Since the release of the Microsoft Kinect Camera and publication of KinectFusion [11] attention has been drawn how to acquire dense models in real-time. In this paper we present a method to make online 3D reconstruction which increases robustness for scenes with little structure information and little texture information. I
The focus of this contribution is the estimation of multi-step-ahead linear multivariate predictors of the output making use of finite input-output data sequences. Different strategies will be presented, the common factor being the exploitations of geometric operations on appropriate subspaces spanned by the data. In order to test the capabilities of the proposed methods in predicting new data, a
