1,720,983 research outputs found
An insurance paradigm for improving power system resilience via distributed investment
Full text linkExtreme events, exacerbated by climate change, pose significant risks to the energy system and its consumers. However there are natural limits to the degree of protection that can be delivered from a centralised market architecture. Distributed energy resources provide resilience to the energy system, but their value remains inadequately recognized by regulatory frameworks. We propose an insurance framework to align residual outage risk exposure with locational incentives for distributed investment. We demonstrate that leveraging this framework in large-scale electricity systems could improve consumer welfare outcomes in the face of growing risks from extreme events via investment in distributed energy
On the Design of an Insurance Mechanism for Reliability Differentiation in Electricity Markets
Full text linkSecuring an adequate supply of dispatchable resources is critical for keeping
a power system reliable under high penetrations of variable generation.
Traditional resource adequacy mechanisms are poorly suited to exploiting the
growing flexibility and heterogeneity of load enabled by advancements in
distributed resource and control technology. To address these challenges this
paper develops a resource adequacy mechanism for the electricity sector
utilising insurance risk management frameworks that is adapted to a future with
variable generation and flexible demand. The proposed design introduces a
central insurance scheme with prudential requirements that align diverse
consumer reliability preferences with the financial objectives of an
insurer-of-last-resort. We illustrate the benefits of the scheme in (i)
differentiating load by usage to enable better management of the system during
times of extreme scarcity, (ii) incentivising incremental investment in
generation infrastructure that is aligned with consumer reliability preferences
and (iii) improving overall reliability outcomes for consumers.Comment: 11 pages, 8 figure
Distributed equilibrium seeking in aggregative games: linear convergence under singular perturbations lens
Full text linkWe present a fully-distributed algorithm for Nash equilibrium seeking in aggregative games over networks. The proposed scheme endows each agent with a gradient-based scheme equipped with a tracking mechanism to locally reconstruct the aggregative variable, which is not available to the agents. We show that our method falls into the framework of singularly perturbed systems, as it involves the interconnection between a fast subsystem – the global information reconstruction dynamics – with a slow one concerning the optimization of the local strategies. This perspective plays a key role in analyzing the scheme with a constant stepsize, and in proving its linear convergence to the Nash equilibrium in strongly monotone games with local constraints. By exploiting the flexibility of our aggregative variable definition (not necessarily the arithmetic average of the agents’ strategy), we show the efficacy of our algorithm on a realistic voltage support case study for the smart grid
A priori data-driven robustness guarantees on strategic deviations from generalised Nash equilibria
Full text linkIn this paper we focus on noncooperative games with uncertain constraints coupling the agents’ decisions. We consider a setting where bounded deviations of agents’ decisions from the equilibrium are possible, and uncertain constraints are inferred from data. Building upon recent advances in the so called scenario approach, we propose a randomised algorithm that returns a nominal equilibrium such that a pre-specified bound on the probability of violation for yet unseen constraints is satisfied for an entire region of admissible deviations surrounding it—thus supporting neighbourhoods of equilibria with probabilistic feasibility certificates. For the case in which the game admits a potential function, whose minimum coincides with the social welfare optimum of the population, the proposed algorithmic scheme opens the road to achieve a trade-off between the guaranteed feasibility levels of the region surrounding the nominal equilibrium, and its system-level efficiency. Detailed numerical simulations corroborate our theoretical results
Coalitional model predictive control for systems of systems
Full text linkAn aspect so far rarely contemplated in distributed control problems is the explicit consideration of individual (local) interests of the components of a complex system. Indeed, the focus of the majority of the literature about distributed control has been the overall system performance. While on one hand this permitted to address fundamental properties of centralized control, such as system-wide optimality and stability, one the other hand it implied assuming unrestricted cooperation across local controllers. However, when dealing with multi-agent systems with a strong heterogeneous character, cooperation between the agents cannot be taken for granted (due to, for example, logistics, market competition), and selfish interests may not be neglected. Another critical point that must be kept into consideration is the diversity characterizing systems of systems (SoS), yielding very complex interactions between the agents involved (one example of such system is the smart grid). In order to tackle such inherent aspects of SoS, the research presented in this thesis has been concerned with the development of a novel framework, the coalitional control, that extends the scope of advanced control methods (in particular MPC) by drawing concepts from cooperative game theory that are suited for the inherent heterogeneity of SoS, providing as well an economical interpretation useful to explicitly take into account local selfish interests. Thus, coalitional control aims at governing the association/dissociation dynamics of the agents controlling the system, according to the expected benefits of their possible cooperation. From a control theoretical perspective, this framework is founded on the theory of switched systems and variable structure/topology networked systems, topics that are recently experiencing a renewed interest within the community. The main concepts and challenges in coalitional control, and the links with cooperative network game theory are presented in this document, tracing a path from model partitioning to the control schemes whose principles delineate the idea of coalitional control. This thesis focuses on two basic architectures: (i) a hierarchically supervised evolution of the coalitional structure, and (ii) a protocol for autonomous negotiation between the agents, with specific mechanisms for benefit redistribution, leading to the emergence of cooperating clusters.Premio Extraordinario de Doctorado U
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Probably approximately correct Nash equilibrium learning
Full text linkWe consider a multi-agent noncooperative
game with agents’ objective functions being affected by
uncertainty. Following a data driven paradigm, we represent uncertainty by means of scenarios and seek a robust
Nash equilibrium solution. We treat the Nash equilibrium
computation problem within the realm of probably approximately correct (PAC) learning. Building upon recent developments in scenario-based optimization, we accompany
the computed Nash equilibrium with a priori and a posteriori probabilistic robustness certificates, providing confidence that the computed equilibrium remains unaffected
(in probabilistic terms) when a new uncertainty realization
is encountered. For a wide class of games, we also show
that the computation of the so called compression set
— which is at the core of scenario-based optimization —
can be directly obtained as a byproduct of the proposed
methodology. We demonstrate the efficacy of our approach
on an electric vehicle charging control problem
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
- …
