Bilateral contracting in multi-agent electricity markets: Negotiation strategies and a case study

Author(s):  
Fernando Lopes ◽  
Hugo Algarvio ◽  
Helder Coelho
Author(s):  
Shuangquan Liu ◽  
Liping Yang ◽  
Qinggui Chen ◽  
Xiangrui Liu ◽  
Chunfeng Mu
Keyword(s):  

2021 ◽  
Vol 10 (2) ◽  
pp. 27
Author(s):  
Roberto Casadei ◽  
Gianluca Aguzzi ◽  
Mirko Viroli

Research and technology developments on autonomous agents and autonomic computing promote a vision of artificial systems that are able to resiliently manage themselves and autonomously deal with issues at runtime in dynamic environments. Indeed, autonomy can be leveraged to unburden humans from mundane tasks (cf. driving and autonomous vehicles), from the risk of operating in unknown or perilous environments (cf. rescue scenarios), or to support timely decision-making in complex settings (cf. data-centre operations). Beyond the results that individual autonomous agents can carry out, a further opportunity lies in the collaboration of multiple agents or robots. Emerging macro-paradigms provide an approach to programming whole collectives towards global goals. Aggregate computing is one such paradigm, formally grounded in a calculus of computational fields enabling functional composition of collective behaviours that could be proved, under certain technical conditions, to be self-stabilising. In this work, we address the concept of collective autonomy, i.e., the form of autonomy that applies at the level of a group of individuals. As a contribution, we define an agent control architecture for aggregate multi-agent systems, discuss how the aggregate computing framework relates to both individual and collective autonomy, and show how it can be used to program collective autonomous behaviour. We exemplify the concepts through a simulated case study, and outline a research roadmap towards reliable aggregate autonomy.


Energies ◽  
2021 ◽  
Vol 14 (13) ◽  
pp. 3747
Author(s):  
Ricardo Faia ◽  
Tiago Pinto ◽  
Zita Vale ◽  
Juan Manuel Corchado

The participation of household prosumers in wholesale electricity markets is very limited, considering the minimum participation limit imposed by most market participation rules. The generation capacity of households has been increasing since the installation of distributed generation from renewable sources in their facilities brings advantages for themselves and the system. Due to the growth of self-consumption, network operators have been putting aside the purchase of electricity from households, and there has been a reduction in the price of these transactions. This paper proposes an innovative model that uses the aggregation of households to reach the minimum limits of electricity volume needed to participate in the wholesale market. In this way, the Aggregator represents the community of households in market sales and purchases. An electricity transactions portfolio optimization model is proposed to enable the Aggregator reaching the decisions on which markets to participate to maximize the market negotiation outcomes, considering the day-ahead market, intra-day market, and retail market. A case study is presented, considering the Iberian wholesale electricity market and the Portuguese retail market. A community of 50 prosumers equipped with photovoltaic generators and individual storage systems is used to carry out the experiments. A cost reduction of 6–11% is achieved when the community of households buys and sells electricity in the wholesale market through the Aggregator.


2009 ◽  
Vol 90 (11) ◽  
pp. 3607-3615 ◽  
Author(s):  
Paolo C. Campo ◽  
Guillermo A. Mendoza ◽  
Philippe Guizol ◽  
Teodoro R. Villanueva ◽  
François Bousquet

2021 ◽  
Vol 61 (6) ◽  
pp. 723-734
Author(s):  
Jennifer F. Byrnes ◽  
William R. Belcher
Keyword(s):  

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Farzaneh Farhadi ◽  
Nicholas R. Jennings

AbstractDistributed multi-agent agreement problems (MAPs) are central to many multi-agent systems. However, to date, the issues associated with encounters between self-interested and privacy-preserving agents have received limited attention. Given this, we develop the first distributed negotiation mechanism that enables self-interested agents to reach a socially desirable agreement with limited information leakage. The agents’ optimal negotiation strategies in this mechanism are investigated. Specifically, we propose a reinforcement learning-based approach to train agents to learn their optimal strategies in the proposed mechanism. Also, a heuristic algorithm is designed to find close-to-optimal negotiation strategies with reduced computational costs. We demonstrate the effectiveness and strength of our proposed mechanism through both game theoretical and numerical analysis. We prove theoretically that the proposed mechanism is budget balanced and motivates the agents to participate and follow the rules faithfully. The experimental results confirm that the proposed mechanism significantly outperforms the current state of the art, by increasing the social-welfare and decreasing the privacy leakage.


Sign in / Sign up

Export Citation Format

Share Document