Stackelberg Interdependent Security Game in Distributed and Hierarchical Cyber-Physical Systems

With the integration of physical plant and network, cyber-physical systems (CPSs) are increasingly vulnerable due to their distributed and hierarchical framework. Stackelberg interdependent security game (SISG) is proposed for characterizing the interdependent security in CPSs, that is, the interactions between individual CPSs, which are selfish but nonmalicious with the payoff function being formulated from a cross-layer perspective. The pure-strategy equilibria for two-player symmetric SISG are firstly analyzed with the strategy gap between individual and social optimum being characterized, which is known as negative externalities. Then, the results are further extended to the asymmetric and m-player SISG. At last, a numerical case of practical experiment platform is analyzed for determining the comprehensively optimal security configuration for administrator

Theoretical Computer Science and Discrete Mathematics

This book includes 15 articles published in the Special Issue "Theoretical Computer Science and Discrete Mathematics" of Symmetry (ISSN 2073-8994). This Special Issue is devoted to original and significant contributions to theoretical computer science and discrete mathematics. The aim was to bring together research papers linking different areas of discrete mathematics and theoretical computer science, as well as applications of discrete mathematics to other areas of science and technology. The Special Issue covers topics in discrete mathematics including (but not limited to) graph theory, cryptography, numerical semigroups, discrete optimization, algorithms, and complexity

Realizing the potential of distributed energy resources and peer-to-peer trading through consensus-based coordination and cooperative game theory

Driven by environmental and energy security concerns, a large number of small-scale distributed energy resources (DERs) are increasingly being connected to the distribution network. This helps to support a cost-effective transition to a lower-carbon energy system, however, brings coordination challenges caused by variability and uncertainty of renewable energy resources (RES). In this setting, local flexible demand (FD) and energy storage (ES) technologies have attracted great interests due to their potential flexibility in mitigating the generation and demand variability and improving the cost efficiency of low-carbon electricity systems. The combined effect of deregulation and digitalization inspired new ways of exchanging electricity and providing management/services on the paradigm of peer-to-peer (P2P) and transparent transactions. P2P energy trading enables direct energy trading between prosumers, which incentivizes active participation of prosumer in the trading of electricity in the distribution network, in the meantime, the efficient usage of FD and ES owned by the prosumers also facilitates better local power and energy balance. Though the promising P2P energy trading brings numerous advancements, the existing P2P mechanisms either fail to coordinate energy in a fully distributed way or are unable to adequately incentivize prosumers to participate, preventing prosumers from accessing the highest achievable monetary benefits and/or suffering severely from the curse of dimensionality. Therefore, this thesis aims at proposing three P2P energy trading enabling mechanisms in the aspect of fully distributed efficient balanced energy coordination through consensus-based algorithm and two incentivizing pricing and benefit distribution mechanisms through cooperative game theory. Distributed, consensus-based algorithms have emerged as a promising approach for the coordination of DER due to their communication, computation, privacy and reliability advantages over centralized approaches. However, state-of-the-art consensus-based algorithms address the DER coordination problem in independent time periods and therefore are inherently unable to capture the time-coupling operating characteristics of FD and ES resources. This thesis demonstrates that state-of-the-art algorithms fail to converge when these time-coupling characteristics are considered. In order to address this fundamental limitation, a novel consensus-based algorithm is proposed which includes additional consensus variables. These variables express relative maximum power limits imposed on the FD and ES resources which effectively mitigate the concentration of the FD and ES responses at the same time periods and steer the consensual outcome to a feasible and optimal solution. The convergence and optimality of the proposed algorithm are theoretically proven while case studies numerically demonstrate its convergence, optimality, robustness to initialization and information loss, and plug-and-play adaptability. Moreover, this thesis proposes two computationally efficient pricing and benefit distribution mechanisms to construct a stable grand coalition of prosumers participating in P2P trading, founded on cooperative game-theoretic principles. The first one involves a benefit distribution scheme inspired by the core tatonnement process while the second involves a novel pricing mechanism based on the solution of single linear programming. The performance of the proposed mechanisms is validated against state-of-the-art mechanisms through numerous case studies using real-world data. The results demonstrate that the proposed mechanisms exhibit superior computational performance than the nucleolus and are superior to the rest of the examined mechanisms in incentivizing prosumers to remain in the grand coalition.Open Acces

Analyzing and Modeling Real-World Phenomena with Complex Networks: A Survey of Applications

The success of new scientific areas can be assessed by their potential for contributing to new theoretical approaches and in applications to real-world problems. Complex networks have fared extremely well in both of these aspects, with their sound theoretical basis developed over the years and with a variety of applications. In this survey, we analyze the applications of complex networks to real-world problems and data, with emphasis in representation, analysis and modeling, after an introduction to the main concepts and models. A diversity of phenomena are surveyed, which may be classified into no less than 22 areas, providing a clear indication of the impact of the field of complex networks.Comment: 103 pages, 3 figures and 7 tables. A working manuscript, suggestions are welcome

Distributed optimal and predictive control methods for networks of dynamic systems

Several recent approaches to distributed control design over networks of interconnected dynamic systems rely on certain assumptions, such as identical subsystem dynamics, absence of dynamical couplings, linear dynamics and undirected interaction schemes. In this thesis, we investigate systematic methods for relaxing a number of simplifying factors leading to a unifying approach for solving general distributed-control stabilization problems of networks of dynamic agents. We show that the gain-margin property of LQR control holds for complex multiplicative input perturbations and a generic symmetric positive definite input weighting matrix. Proving also that the potentially non-simple structure of the Laplacian matrix can be neglected for stability analysis and control design, we extend two well-known distributed LQR-based control methods originally established for undirected networks of identical linear systems, to the directed case. We then propose a distributed feedback method for tackling large-scale regulation problems of a general class of interconnected non-identical dynamic agents with undirected and directed topology. In particular, we assume that local agents share a minimal set of structural properties, such as input dimension, state dimension and controllability indices. Our approach relies on the solution of certain model matching type problems using local linear state-feedback and input matrix transformations which map the agent dynamics to a target system, selected to minimize the joint control effort of the local feedback-control schemes. By adapting well-established distributed LQR control design methodologies to our framework, the stabilization problem of a network of non-identical dynamical agents is solved. We thereafter consider a networked scheme synthesized by multiple agents with nonlinear dynamics. Assuming that agents are feedback linearizable in a neighborhood near their equilibrium points, we propose a nonlinear model matching control design for stabilizing networks of multiple heterogeneous nonlinear agents. Motivated by the structure of a large-scale LQR optimal problem, we propose a stabilizing distributed state-feedback controller for networks of identical dynamically coupled linear agents. First, a fully centralized controller is designed which is subsequently substituted by a distributed state-feedback gain with sparse structure. The control scheme is obtained byoptimizing an LQR performance index with a tuning parameter utilized to emphasize/deemphasize relative state difference between coupled systems. Sufficient conditions for stability of the proposed scheme are derived based on the inertia of a convex combination of two Hurwitz matrices. An extended simulation study involving distributed load frequency control design of a multi-area power network, illustrates the applicability of the proposed method. Finally, we propose a fully distributed consensus-based model matching scheme adapted to a model predictive control setting for tackling a structured receding horizon regulation problem