scholarly journals Optimal Allocation Method for a Fair Distribution of the Benefits in an Energy Community

Solar RRL ◽  
2021 ◽  
Author(s):  
Valeria Casalicchio ◽  
Giampaolo Manzolini ◽  
Matteo Giacomo Prina ◽  
David Moser
2013 ◽  
Vol 15 (03) ◽  
pp. 1340016 ◽  
Author(s):  
SYLVAIN BEAL ◽  
AMANDINE GHINTRAN ◽  
ERIC REMILA ◽  
PHILIPPE SOLAL

The river sharing problem deals with the fair distribution of welfare resulting from the optimal allocation of water among a set of riparian agents. Ambec and Sprumont [Sharing a river, J. Econ. Theor. 107, 453–462] address this problem by modeling it as a cooperative TU-game on the set of riparian agents. Solutions to that problem are reviewed in this article. These solutions are obtained via an axiomatic study on the class of river TU-games or via a market mechanism.


Games ◽  
2021 ◽  
Vol 12 (3) ◽  
pp. 61
Author(s):  
Xupeng Wei ◽  
Achilleas Anastasopoulos

We consider a demand management problem in an energy community, in which several users obtain energy from an external organization such as an energy company and pay for the energy according to pre-specified prices that consist of a time-dependent price per unit of energy as well as a separate price for peak demand. Since users’ utilities are their private information, which they may not be willing to share, a mediator, known as the planner, is introduced to help optimize the overall satisfaction of the community (total utility minus total payments) by mechanism design. A mechanism consists of a message space, a tax/subsidy, and an allocation function for each user. Each user reports a message chosen from her own message space, then receives some amount of energy determined by the allocation function, and pays the tax specified by the tax function. A desirable mechanism induces a game, the Nash equilibria (NE), of which results in an allocation that coincides with the optimal allocation for the community. As a starting point, we design a mechanism for the energy community with desirable properties such as full implementation, strong budget balance and individual rationality for both users and the planner. We then modify this baseline mechanism for communities where message exchanges are allowed only within neighborhoods, and consequently, the tax/subsidy and allocation functions of each user are only determined by the messages from their neighbors. All of the desirable properties of the baseline mechanism are preserved in the distributed mechanism. Finally, we present a learning algorithm for the baseline mechanism, based on projected gradient descent, that is guaranteed to converge to the NE of the induced game.


2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Chengying Wei ◽  
Qinren Shen ◽  
Huanlin Liu ◽  
Yong Chen

The grooming node has the capability of grooming multicast traffic with the small granularity into established light at high cost of complexity and node architecture. In the paper, a grooming nodes optimal allocation (GNOA) method is proposed to optimize the allocation of the grooming nodes constraint by the blocking probability for multicast traffic in sparse WDM networks. In the proposed GNOA method, the location of each grooming node is determined by the SCLD strategy. The improved smallest cost largest degree (SCLD) strategy is designed to select the nongrooming nodes in the proposed GNOA method. The simulation results show that the proposed GNOA method can reduce the required number of grooming nodes and decrease the cost of constructing a network to guarantee a certain request blocking probability when the wavelengths per fiber and transmitter/receiver ports per node are sufficient for the optical multicast in WDM networks.


Sign in / Sign up

Export Citation Format

Share Document