Filetype
In inverse optimal control, an optimal controller is synthesized with respect to a meaningful, a posteriori defined, cost functional. Our work illustrates the usefulness of this approach in the control of converter-based power systems and networked systems in general, and thereby in finding controllers with topological structure and known optimality properties. In particular, we design an inverse
Low-rank inducing unitarily invariant norms have been introduced to convexify problems with a low-rank/sparsity constraint. The most well-known member of this family is the so-called nuclear norm. To solve optimization problems involving such norms with proximal splitting methods, efficient ways of evaluating the proximal mapping of the low-rank inducing norms are needed. This is known for the nuc
We prove that for k ≫; 4√n regular resolution requires length nω(k) to establish that an ErdÅ's-Rényi graph with appropriately chosen edge density does not contain a k-clique. This lower bound is optimal up to the multiplicative constant in the exponent and also implies unconditional nω(k) lower bounds on running time for several state-of-the-art algorithms for finding maximum cliques in graphs.
Engineers require high-quality data for the design and implementation of today’s software, especially in the context of machine learning (ML). This puts an emphasis on the need for the publication and sharing of data from and between organizations, public as well as private. Following the paradigm of open innovation, open data provide a mechanism to increase the availability of information, offeri
State estimators are crucial components of anomaly detectors that are used to monitor cyber-physical systems. Many frequently-used state estimators are suscepti- ble to model risk as they rely critically on the availability of an accurate state-space model. Modeling errors make it more difficult to distinguish whether deviations from expected behavior are due to anomalies or simply a lack of knowl
In order to improve the energy efficiency in district heating networks and the comfort of their customers, these networks need to overcome the problem of unfair heat distribution under heat deficits. This paper introduces a new strategy to achieve this thermal fairness objective: it is lowcost in terms of communication and computation. The proposed approach is illustrated on a simulation example.
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
The Bonacich centrality is a well-known measure of the relative importance of nodes in a network. This notion is, for example, at the core of Google’s Page Rank algorithm. In this paper we study a network formation game where each player corresponds to a node in the network to be formed. The action of a player consists in the assignment of m out-links and his utility is his own Bonacich centrality
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
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
Many iterative optimization algorithms involve compositions of special cases of Lipschitz continuous operators, namely firmly nonexpansive, averaged, and nonexpansive operators. The structure and properties of the compositions are of particular importance in the proofs of convergence of such algorithms. In this paper, we systematically study the compositions of further special cases of Lipschitz c
This paper presents an LO frequency multiplier and phase shifter for the 28-GHz band, implemented in 28nm FD-SOI CMOS technology. The phase control is introduced in an injection-locked oscillator, followed by an injection-locked frequency tripler. The phase of the output signal is compared with that of the input signal using a phase detector based on third harmonic mixing, enabling automatic phase
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
