Distributed, Private, and Derandomized Allocation Algorithm for EV Charging

# Distributed, Private, and Derandomized Allocation Algorithm for EV Charging

Hamid Nabati111Concordia University, Montreal, Quebec, Canada, (h_nabati@encs.concordia.ca), Jia Yuan Yu222Concordia University, Montreal, Quebec, Canada, (jiayuan.yu@concordia.ca)
###### Abstract

Efficient resource allocation is challenging when privacy of users is important. Distributed approaches have recently been used extensively to find a solution for such problems. In this work, the efficiency of distributed AIMD algorithm for allocation of subsidized goods is studied. First, a suitable utility function is assigned to each user describing the amount of satisfaction that it has from allocated resource. Then the resource allocation is defined as a total utilitarianism problem that is an optimization problem of sum of users utility functions subjected to capacity constraint. Recently, a stochastic state-dependent variant of AIMD algorithm is used for allocation of common goods among users with strictly increasing and concave utility functions. Here, the stochastic AIMD algorithm is derandomized and its efficiency is compared with the stochastic version. Moreover, the algorithm is improved to allocate subsidized goods to users with concave and nonmonotonous utility functions as well as users with Sigmoidal utility functions. To illustrate the effectiveness of the proposed solutions, simulation results is presented for a public renewable-energy powered charging station in which the electric vehicles (EV) compete to be recharged.

## 1 Introduction

In many real-world applications, the goal is allocating scarce resources among users in order to achieve maximum total utility so-called total utilitarianism. The concept of the utility here represents the satisfaction level of each user from the allocated resources. It normally leads to solve an optimization problem that the objective function is the sum of users utility functions subjected to capacity and other constraints. Mathematically speaking, we have

 maximizex1,…,xn n∑i=1ui(xi) (1) subject to n∑i=1xi≤C, xi≥0,i=1,…,n,

where and denote each user ’s utility function and allocated resource, respectively and denotes the capacity constraint. Each user’s utility function and number of user involved in resource allocation problem are unknown and reaching to capacity constraint is just informed by a notification.
To solve the optimization problem given by (1), there are two main solution approaches: centralized and distributed. Centralized solutions are more efficient since users first admit their individual utility functions to a decision maker, which then solves the optimization problem to find the optimal allocated resources. However, users utility functions are private information and the drawback is that users’ privacy protections is challenged. Distributed allocation is a key concept to resolve this conundrum, i.e., to efficiently allocate resources while preserving privacy. In distributed resource allocation, a set of users must autonomously assign their resources with respect to certain criteria and the main goal is to reach the global optimum.
To model different problems, we need to approximate each user’s satisfaction with a suitable utility function. We consider three following cases. First, for allocation of common goods, where users do not pay a fee per use, we adopt concave and strictly increasing utility functions, since it provides mathematical tractability  however limits its applicability. Second, for allocation of subsidized goods, where the fee per use is shared with the entire population, each user payoff function is defined as the difference between the user utility function and the cost of received resources. Therefore, considering concave and strictly increasing utility functions, users payoff functions are concave and nonmonotonous. Third, consider allocation of goods that are only useful in sufficient quantities. Herein, each user’s satisfaction ideally described by a discontinuous Step function that we approximate with a continuous Sigmoidal utility function .

###### Example 1 (EV Charging).

Recent studies reveal that a fuel-driven vehicle can produce less greenhouse gas emissions than an EV if the recharging energy is entirely produced by coal-fired power plants. Therefore, local stations for charging EVs from renewable energy significantly contributes to achieve real environmental benefits . Imagine a charging station of Electric Vehicles (EVs) whose power supplies from renewable energy (e.g., solar, wind). Such stations have limited available resources and demand for these finite amounts of energy is also increasing. The users are EV owners who connect their vehicles to the charging station, and intuitively some of users need their vehicles more than others (e.g., the handicapped, elderly, and parents with young kids to pick-up after work). A private utility function determines the level of satisfaction for each EV owner whose EV is connected to the station to be charged. As the demand for the resource overwhelms the capacity, every individual who consumes an additional unit directly harms others who can no longer enjoy the benefits. However, since the return of EVs to charging station is non-deterministic, it seems reasonable to assume that EV owners are greedy and prefer to charge their own EVs regardless of others due to avoid range anxiety. The users’ utility functions are chosen normalized logarithmic to represent strictly increasing concave functions as well as Sigmoidal to approximate Step functions. Figure 1: Utility functions: normalized logarithmic (strictly-increasing concave) utility function ui and corresponding nonmonotonous payoff functions vi when L=0.4, as well as a discontinuous Step utility function fi and corresponding approximate continuous Sigmoidal utility function wi.

In this paper, we propose a distributed and iterative algorithm, that is a computationally efficient and private solution of the resource allocation problems. A stochastic version of the algorithm was used for common goods such as clean air and access to public road in . We extend the applications and we make the following specific contributions. We propose derandomized version of AIMD algorithm to allocate common goods to users with strictly increasing, concave utility functions. We also propose AIMD algorithm to allocate subsidized goods, where the fee per use is shared with the entire population, to users with concave and nonmonotonous utility functions. We extend the results to propose a variant of AIMD algorithm to allocate common goods to users with Sigmoidal utility functions.
The rest of this paper is organized as follows. Section 2 presents the problem formulation. In section 3, we propose variants of AIMD distributed algorithm for allocation of subsidized (and common) goods among users based on their specific utility functions. Section 4, includes EV charging simulation setup and discuss the numerical results. Section 6 concludes the paper.

## 2 Distributed Resource Allocation

In this section, we formally define resource allocation problem using utility function concept for both centralized and distributed solution approaches. The objective is to determine each user’s optimal allocated resource at which maximum total utility is achieved.

###### Remark 1.

In real life applications, the resource could be time-slotted like energy in or time-varying like power in . Although, we consider a time-slotted optimization problem, we can use the proposed solution for any time-varying situations without changing the results.

### 2.1 Baseline and Problem Formulation

Consider users utilize a shared limited resource , and let represents the possible allocated resource to each user . We attribute a utility, i.e., a measure of satisfaction, to each user who takes advantage of the common resource and describe it by means of a utility function. The utility function , assigns a non-negative real number to each possible value of allocated resource , to represent the level of satisfaction for each user or quality of service (QoS).
A class of centralized resource allocation problems can be formulated as a nonlinear continuous optimization problem (1) that is also represented in Figure 4a. In such problems, a central decision maker calculates the optimal solution vector , by collecting all information regarding each user’s utility function , capacity constraint , and number of users . Although centralized solution approaches focus to determine efficient resource allocation, in many realistic applications, it is neither applicable nor desirable  since it violates users’ privacy.
Figure 4(b) depicts a class of distributed (and iterative) approach to resource allocation problems in which allocations emerge as the result of an iterative of local procedures. In other words, a set of users locally make decisions regarding their resources autonomously. To this end, an algorithm is used to assign each user an allocated resource in time steps (iterations) . In each iteration, each user’s algorithm update user’s allocated resource locally by choosing one of these options: increase, decrease or no-change compared with previous iteration . The increase option continues until receiving one bit signal , that notify capacity constraint is violated and algorithm, based on a certain probability, choose one of the following options: decrease or no-change. When the capacity is available again , the increase option of the algorithm restarts immediately. The procedure repeats until the number of iterations is large enough , and users’ allocated resource converge to the optimal allocation .
In order to quantify efficiency of distributed resource allocation, we express the efficiency as follows:

 efficiency at time t=limt→∞∑ni=1ui(xi(t))∑ni=1ui(x∗i), (2)

where the numerator is the output of proposed distributed algorithm and the denominator is the solution of an interior-point optimization algorithm. In the following sections, we show that the efficiency converges to .

## 3 AIMD Algorithm

In this section, we describe several variants of AIMD algorithm.

###### Remark 2.

AIMD (Additive Increase Multiplicative Decrease) is a distributed and iterative algorithm that is used widely to control congestion in computer networks. The objective of AIMD is to determine the share of the resource for each user while total demands remains less than the available capacity, and where the limited communication in the network is desired. The AIMD algorithm, in its basic version, is composed of two procedures. In the additive increase (AI) phase, users continuously request for more available resource of the network until receiving a notification that the aggregate amount of available resource has been exceeded. Then the multiplicative decrease (MD) phase occurs and users respond to the notification by reducing their share proportionally. The AI phase of the algorithm restarts again immediately and this pattern is repeated by each active user in the network .

For the sake of representation, we reproduce the stochastic allocated-dependent version of AIMD algorithm that is used for allocation of common goods among users with concave and strictly increasing utility functions. We shall not describe the guaranties of the algorithm here, rather we refer the interested readers to  for details. Thus, we consider a further and substantial assumption, so-called concavity assumption, for users utility functions which provide mathematical tractability of optimization problem (1).

###### Assumption 1.

(Concavity Assumption) The utility functions , {enumerate*}[label=()]

are strictly increasing functions of with ,

are concave and continuously diffrentiable with domain , where is the amount of resources allocated to user .

###### Example 2.

We use normalized logarithmic function Equation (3) as strictly increasing concave utility function that satisfies Concavity Assumption 1 in order to model the level of satisfaction of EV owners whose car is connected to the charging station to be charged.

 ui(xi)=100log(1+ηixi)log(1+ηiχi), (3)

where in is the amount of allocated resource (EV charging) that gives unit utility to the user . It also satisfies . The parameter indicates how the charge needed urgently by effecting on the rate of utility percentage that is a function of allocated resource . Intuitively higher values of yield higher utility to user . Figure 1 represents a normalized logarithmic utility functions with .

In AI phase, each active user continues to update its allocated resource upward by adding an amount of growth factor to its previous allocated resource while . When the capacity limit has been violated, i.e., , users are notified to execute MD phase. Each user will respond to the capacity signal independently with a certain probability , by multiplying the previous allocated resource to a drop factor to form current allocated resource . The probability at -th iteration, for each user , depends on the long-term average allocated resource  through the relation , where the parameter is chosen to ensure that .

### 3.1 Derandomized Algorithm

The proposed stochastic AIMD Algorithm 1 is considered to have access to sources of perfect randomness, i.e. unbiased and completely independent random variables, however in real-world implementation, the physical sources of randomness to which we have access may contain biases and correlations . Thus, the probabilistic method can also yield insight into how to construct deterministic algorithms . We now propose a variant of deterministic AIMD for the same purpose.

We show that the strong convergence of derivative of utility function of long-term average allocated resource , can be used to allocate resource optimally. Therefore, there exists a derandomized algorithm with the same performance as the randomized algorithm.
We define a vector consists of real-valued elements by

 z(t):=[x1…xn ¯x1 …¯xn λ1…λn]⊤, (4)

and let a class of functions such that

 z(t)=f(t)(z(t−1)). (5)

Each function , is also considered …
The allocated resource at -th iteration, for each user , is calculated as Equations (6).

 xi(t)=(xi(t−1)+α)\mathds1[∑nj=1xj(t)
 ¯xi(t)=1t+1t∑k=1xk (7)

Therefore, iterated function systems (IFS) is defined as: We define and we use it in MD phase of the algorithm by to build DAIMD Algorithm 2.

### 3.2 Subsidized Goods

We extend resource allocation problem to subsidized goods where the fee per use is shared with the entire population. Suppose if each user is charged a constant price per unit of the received resources . Each user payoff function, is defined as utility function minus the cost of received resource as follows:

 vi(xi)=ui(xi)−Lxi. (8)

Recall each user utility function is considered under Concavity Assumption 1, therefore, each user payoff function (8) is a concave function but it is not necessarily increasing. The centralized resource allocation problem can then be formulated as follows:

 maximizex1,…,xn n∑i=1vi(xi) (9) subject to n∑i=1xi≤C, xi≥0,i=1,…,n.

The optimization problem 9 in which the objective function is non-negative sum of concave functions, is concave and there exists a global optimal solution .

###### Example 3.

Suppose normalized logarithmic function Equation (3) to show each EV owner’s satisfaction from receiving an amount of energy allocation . The cost of allocated energy is defined as the price of energy in monetary units, multiply in energy allocation . Therefore, the payoff function is defined as follows:

 vi(xi)=100log(1+ηixi)log(1+ηiχi)−Lxi. (10)

Figure 1 represents a normalized logarithmic utility function with compared with corresponding payoff functions when .

We improve AIMD Algorithm 1 by controlling the allocation do not exceed from maximum payoff of each user and design the PAIMD Algorithm 3. The control is applied locally since each user calculates the optimal point and then in each iteration, in the (AI) phase of the algorithm compare it to allocated resource to choose the minimum allocation.

Based on , define bounded value

### 3.3 Sigmoidal Utility Functions

In this section, we model resource allocation problem (1) using Sigmoidal users’ utility functions that is defined as following:

###### Definition 1.

The utility function of is defined to be Sigmoidal if: {enumerate*}[label=()]

The and is strictly increasing function of .

is continuously differentiable, with domain .

is convex for and is concave for , which is the inflection point.

###### Example 4.

(Why do we need Sigmoidal utility functions?). In some situations, such as charging an electric vehicle with the goal of reaching a predetermined destination (e.g., airport, home, etc.), the user receive negligible (or non) utility until a threshold of resource is reached (e.g., enough electric charge to arrive at the destination). Ideally, the best description of the utility function is through a discontinuous Step function as follows:

 fi(xi)={0if xi<θi;100if xi≥θi, (11)

where shows the sufficient allocated resource that gives 100 unit utility to user .
Continious Sigmoidal utility functions may be used to approximate a step utility function to any arbitrary accuracy . Thus, we model EV owner’s satisfaction with Sigmoidal utility function that is expressed by:

 wi(xi)=1001+e−ηi(xi−ψi)−1001+eηiψi, (12)

where is the steepness of the curve that indicates how the charge is needed urgently for each user . The parameter in is the inflection point that achieving it satisfies the urgent need of user . The function, also, satisfies and . Figure 1 represents a Step utility function  with and an approximate corresponding Sigmoidal utility function  with  and .

The QAIMD Algorithm 4 represents the procedure of allocation among users with Sigmoidal utility functions. The key point is that in each iteration , the long-term of allocated resource is compared with each user ’s inflection point . If , the increase phase is built by multiplying the previous state in a growth factor to construct current state with a probability . The decrease phase also is made by subtracting from the previous state. When , the algorithm is work with AIMD Algorithm 1 procedure. Note that there are two parameters , to ensure in each case.

## 4 Simulation

In order to figure out the effectiveness, the AIMD Algorithm 23 and 4 was applied to various logarithmic and Sigmoidal utility functions with different parameters in MATLAB.
The resource allocation domain is considered as a charging station whose power supplies from renewable energy (e.g. solar or wind), with constant capacity in equal to of the sum of users utility functions when each user receives unit satisfaction. The users are the EV owners who connected their vehicles to the station for charging at the same time. The AIMD parameters are identical for all users with and . The parameter is also chosen to assure us the condition is satisfied.

First, we adopt normalized logarithmic utility function expressed by (3), as a strictly increasing concave function which satisfies Concavity Assumption 1. We choose independent uniformly distributed random number with support and independent uniformly distributed random number with support .
We apply deterministic DAIMD Algorithm 2 for allocation of power as a common good (no charging fee) to EVs connected to the charging station. Figure (a)a shows a rapid convergence for derivative of payoff functions when iteration increases. It also reveals the coincidence of deterministic and stochastic versions of derivative of payoff functions . Figure (b)b depicts the value of long-term average state for two randomly selected users and shows each of them converge to a stable value. It also represents that deterministic and stochastic version of average state fluctuate differently but the long-term averages for each user converge to optimal allocation. The efficiency of deterministic DAIMD Algorithm 2, calculated by Equation (2), in different runs are a real number in the range of .
We also apply stochastic PAIMD Algorithm 3 for allocation of power as a subsidized good to EVs connected to charging station. Therefore, we consider the price per unit of the power in the payoff function (10). Figure (c)c, depicts the efficiency of PAIMD Algorithm 3 compared with AIMD Algorithm 1, both calculated by Equation (2). The efficiency of PAIMD Algorithm 3 decreases when the value of increases until receiving to a minimum value in (). For large values of the efficiency of PAIMD Algorithm 3 increases and converge to .
Second, we model EV owner satisfaction with Sigmoidal utility function that are expressed by Equation (12). We choose independent uniformly distributed random number with support and independent uniformly distributed random number with support . The parameter and is also chosen to assure us the condition is satisfied. Figure (a)a depicts the derivative of utility functions for six randomly selected users. It illustrates that the derivatives approach to zero as increase but the convergence is slower than the derivatives of logarithmic utility function in Figure (a)a . In Figure (b)b the average of allocated resource for six randomly selected users is displayed. It shows approach to a constant value for some users and to for some other users.
Figure (c)c represents the efficiency of QAIMD 4, calculated by Equation (2), for different capacity , where . For each user  the algorithm decides between increasing allocated resource or decreasing it toward zero. The efficiency of the algorithm is better for small values of capacity constraint, but it decrease when capacity is around . The efficiency improve again when is large enough.

## 5 Loss of Efficiency Due to Competition

In this section, we allow the individual users to act strategically as in a game. We consider a game in strategic form, where all users’ utility functions are common knowledge. The resulting competition over a scarce resource is reminiscent of the tragedy of the commons . An user may deviate from the AIMD algorithm and strategically request more resource in order to improve its payoff. Alternatively, an user may follow the AIMD algorithm but mispresent its utility function. However, we show that, in some situations, the AIMD outcome and the game’s Nash equilibrium are close to each other.

### 5.1 Resource Allocation as a Strategic Game

Imagine a resource allocation problem in which there are users, competing to utilize a scarce fixed common resource of . Each user chooses his own consumption of resources from a set of action space . A profile of actions describe a particular combination of actions chosen by all users, where is a particular possible of actions for all players who are not .

Consuming an amount gives user a benefit equal to when and intuitively no other users benefits from ’s choice. When increases or other users consume more resources so that , the user get nothing because additional requested resources are not provided. Then we define the payoff function of a user from a profile of actions as

 ~ui(xi,x−i)={ui(xi)if ∑nj=1xj≤C;0if ∑nj=1xj>C. (13)

Where the utility function is considered to be concave, strictly increasing, and continuously differentiable ,i.e., follows assumption 1.

The strategic game , that have infinitely many pure strategies but utility functions are not continuous, is discontinuous infinite strategic games. This problem should be consider precisely because it may lead to problem of nonexistence of unique Nash equilibrium.

### 5.2 Nash Equilibrium

To cut to the chase, the key notion to solve the strategic game , is the Nash equilibrium, that is an outcome (a decision made by each player) such that no player can improve his individual payoff through an unilateral move. As stable situations, Nash equilibrium are often considered to be the expected outcomes from interactions. To solve for a Nash equilibrium we compute the best-response function correspondence for each player and then find an action profile for which all best-response functions are satisfied together.

To find a solution for Equation (13), we first write out each player ’s best-response correspondence and we consider that given , player will want to choose an element in . Given each player ’s best response is the difference between and . If user asks for more, then all users get nothing while if asks for less then he is leaving some resources unclaimed and therefore

 BRi(x−i)=C−n∑j≠ixj. (14)

It is easy to see from the best response correspondence that any profile of demands that add up to will be a Nash equilibrium. Hence, each player is indifferent between all of his requests and the game is just not blessed with a unique equilibrium and has an infinite number of equilibria. The obvious problem with multiple equilibria is that the players may not know which equilibrium will prevail. Hence, it is entirely possible that a non-equilibrium outcome results because one player plays one equilibrium strategy while a second player chooses a strategy associated with another equilibrium .

It turns out that resource allocation encounters conflict over scare resources that results from the tension between individual selfish interests and common good. As Hardin stated in his article , “freedom in a commons brings ruin to all,” that here means, social utility of an uncontrolled use of the common resources that each user have the freedom to make choices, is worse than if those choices were regulated. This results in the occurrence of the phenomenon called tragedy of the commons. In fact, individual users acting independently according to their own self-interest behave contrary to the common good of all users by depleting that resource through their collective actions.

To solve this problem, we first need to bring back the continuity to the payoff function Equation (13). Thus, we apply the resource allocation back-off condition directly to the payoff function for each user . We define a concave penalty function so that and and multiply it to the payoff function (13). To generalize, we also consider each unit of resource costs and we have

 ~vi(xi,x−i)=ui(xi)τ(n∑j=1xj)−Lxi, (15) for allxi,xj∈[0,∞).
###### Example 5.

Consider, for example, the concave penalty function as follows:

 τ(z)=√1−zpCp , (16)

where and . Intuitively, and .

Figure 7 represents some examples of concave penalty functions Equation (16) for . Although the larger values of reduce inefficiency of Nash equilibrium, however make calculations more complex. In realistic situation of EV charging, this function can be programmed to the charger and it works when the demand exceeds from capacity .

Since the payoff functions are continuous there is a strong result on existence of the pure Nash equilibrium that is stated by Theorem 1 .

###### Theorem 1.

(Debreu, Glicksberg, Fan) An infinite strategic form game such that for each {enumerate*}[label=()]

is compact and convex;

is continuous in ;

is continuous and concave 333in fact quasi-concavity suffices. in . Then a pure strategy Nash equilibrium exists.

Another important question that arises in the analysis of strategic form games is whether the Nash equilibrium is unique. Theorem 2, provides sufficient conditions for uniqueness of an equilibrium in games with infinite strategy sets.

###### Theorem 2 (Theorem 1, ).

Consider a strategic form game . For all , assume that the action sets , where is a concave function, and there exists some such that . Assume also that the payoff functions are diagonally strictly concave for . Then the game has a unique pure strategy Nash equilibrium. Where payoff functions are diagonally strictly concave for , if for every , we have .

The game has unique Nash equilibrium that is calculated by maximizing user ’s payoff function and finding the solution to the first order conditions. So, we write down the first-order condition of user ’s payoff function as follows

 xnei=∂~vi(xi,x−i)∂xi=0. (17)

We therefore have such equations, one for each player, and the unique Nash equilibrium is the strategy profile for which all users in the network, the Equation 17 are satisfied together, so that

 xne=(xnei,xne−i), xnei=argmaxxi∈[0,C] ~vi(xi,x−i), ∀i∈N. (18)

When resource allocation problem form as a result of selfish competition among users, the resulting stable solution may not, in fact, be system optimal . In this circumstance, we would like to measure inefficincy constituted due to decentralized control. This is very important to decide whether a decentralized mechanism can be applied, regarding the loss of efficiency in comparison with the performance that would be obtained with a central authority. Price of anarchy (PoA)  , is a concept that quantifies this inefficiency and is measured as the ratio between the worst equilibrium and the centralized solution. In the problem considered here, this notion will be slightly different and defined as the efficiency of the unique Nash equilibrium of the game and the optimal centralized solution of (10) as follows:

 PoA=∑ni=1~vi(xnei)∑ni=1vi(x∗i), (19)

where is the unique Nash equilibrium given by (18) and is the solution of (10) .

### 5.3 Simulation

In this section, we proceed to simulate resource allocation in competition game to investigate in more details the inefficiency of Nash equilibrium. For this purpose, suppose the EV charging station settings of the section LABEL:Sec:AIMD_Numerical_Simulation. Each user’s utility function is considered as the normalized logarithmic function (3) with uniformly distributed random parameters of and . We also consider the concave penalty function Equation 16 with for executing the simulation. We start to simulate the problem for two players. Consider the charging station with the limited resource of and two EV owners which their EVs are connected to the station for charging. Both players have normalized logarithmic utility function Equation (3) with parameters , and , respectively. Figure LABEL:fig:contour_Csmall_tau depicts inefficiency of distributed competitive resource allocation in two-player game ,i.e., best response functions lines intersection, compared with optimal solution .

Now consider the same setting for a charging station with users. Figure plots social optimum of Nash equilibrium , compared with optimal centralized solution for diffrent . Figure 8 represents the price of anarchy in competition against two parameters of price and number of users. The PoA is so sensitive to number of users in the competition such that increasing number of users negatively affect on PoA. Moreover, if the selfish behavior of users in competition do not control by pricing, inefficiency increase and consequently the PoA decrease. Note that the price of anarchy is independent of the competition topology .

### 5.4 Related Work

Both centralized and distributed solution approaches for the generic problem of resource allocation were studied widely in various fields of expertise and a full review is impossible here. In data networks, that the optimization problem called Network Utility Maximization (NUM), users utility functions are commonly considered to be concave, continuous and strictly increasing functions modeling elastic networks , which are more mathematically tractable , but limits applicability. Many other applications require inelastic network that are more challenging, where non-concave or discontinuous utility functions need to be maximized. Inelastic networks studied in  and Sigmoidal programming algorithm is proposed in . In , using utility proportional fairness policy, both elastic and inelastic utility functions compared.
There is also substantial literature on AIMD, the algorithm proposed in  and applied experimentally in , as the most efficient-fair rate control in Internet applications. The efficiency and fairness of the AIMD algorithm also investigated in  and a comprehensive review of the AIMD algorithm and its applications is collected in . This work uses the result of  that used AIMD algorithm in stochastic framework for common goods resource allocation.
EV charging has been the most widely studied as an application of distributed resource allocation. In , proposed a distributed control algorithm that adapts the charging rate of EVs to the available capacity of the network ensuring that network resources are used efficiently and each EV charger receives a fair share of these resources. In , proposed a distributed AIMD based algorithm to allocate available power among connected EVs in order to maximize the utilization of EV owners in a range of situations. In , they also used the same formalization framework to expand the modifications of the basic AIMD algorithm to charge EVs. In both articles they considered a fairness policy as a constraint. The effectiveness of AIMD at mitigating the impact of domestic charging of EVs on low-voltage distribution networks is investigated .

## 6 Conclusions & Future Work

Our work represents a variety of AIMD-based distributed algorithms for efficient and private resource allocations in real life applications. We considered two type of users’ utility functions based on the application, first strictly increasing concave functions to represent greediness of users and second Sigmoidal functions to describe the utility from goods that are only useful in sufficient quantities. We introduced a stochastic AIMD algorithm to allocate subsidized goods where users have concave and nonmonotonous utility functions. We also proposed derandomized version of AIMD algorithm to allocate common goods to users with strictly increasing utility functions. We extended the results to propose the variant of AIMD algorithm to allocate common resource where users have Sigmoidal utility functions. The numerical simulations of EV charging are also included in order to validate the convergence of our solutions.

## References

•  A. Abdel-Hadi and C. Clancy. A utility proportional fairness approach for resource allocation in 4g-lte. In Computing, Networking and Communications (ICNC), 2014 International Conference on, pages 1034–1040. IEEE, 2014.
•  O. Ardakanian, C. Rosenberg, and S. Keshav. Distributed control of electric vehicle charging. In Proceedings of the fourth international conference on Future energy systems, pages 101–112. ACM, 2013.
•  S. Boyd and L. Vandenberghe. Convex optimization. Cambridge university press, 2004.
•  G. P. Cachon and S. Netessine. Game theory in supply chain analysis. In Models, Methods, and Applications for Innovative Decision Making, pages 200–233. INFORMS, 2006.
•  D. M. Chiu and R. Jain. Analysis of the increase and decrease algorithms for congestion avoidance in computer networks. Computer Networks and ISDN systems, 17(1):1–14, 1989.
•  M. Corless, C. King, R. Shorten, and F. Wirth. AIMD dynamics and distributed resource allocation. SIAM, 2016.
•  G. Debreu. A social equilibrium existence theorem. Proceedings of the National Academy of Sciences, 38(10):886–893, 1952.
•  M. Fazel and M. Chiang. Network utility maximization with nonconcave utilities using sum-of-squares method. In Decision and Control, 2005 and 2005 European Control Conference. CDC-ECC’05. 44th IEEE Conference on, pages 1867–1874. IEEE, 2005.
•  P. Hande, S. Zhang, and M. Chiang. Distributed rate allocation for inelastic flows. IEEE/ACM Transactions on Networking, 15(6):1240–1253, 2007.
•  G. Hardin. The tragedy of the commons. Journal of Natural Resources Policy Research, 1(3):243–253, 2009.
•  V. Jacobson. Congestion avoidance and control. In ACM SIGCOMM computer communication review, volume 18, pages 314–329. ACM, 1988.
•  F. Kelly. Charging and rate control for elastic traffic. European transactions on Telecommunications, 8(1):33–37, 1997.
•  E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Annual Symposium on Theoretical Aspects of Computer Science, pages 404–413. Springer, 1999.
•  A. Lahanas and V. Tsaoussidis. Exploiting the efficiency and fairness potential of aimd-based congestion avoidance and control. Computer Networks, 43(2):227–245, 2003.
•  J. W. Lee, R.R. Mazumdar, and N.B. Shroff. Nonconvexity issues for internet rate control with multiclass services: stability and optimality. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, volume 1. IEEE, 2004.
•  S. Lichter, C. Griffin, and T. Friesz. The calculation and simulation of the price of anarchy for network formation games. arXiv preprint arXiv:1108.4115, 2011.
•  M. Liu and S. McLoone. Enhanced aimd-based decentralized residential charging of evs. Transactions of the Institute of Measurement and Control, 37(7):853–867, 2015.
•  J. R. Marden and A. Wierman. Distributed welfare games. Operations Research, 61(1):155–168, 2013.
•  M. Mitzenmacher and E. Upfal. Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge university press, 2005.
•  J. B. Rosen. Existence and uniqueness of equilibrium points for concave n-person games. Econometrica: Journal of the Econometric Society, pages 520–534, 1965.
•  T. Roughgarden. The price of anarchy is independent of the network topology. Journal of Computer and System Sciences, 67(2):341–364, 2003.
•  S. Shenker. Fundamental design issues for the future internet. IEEE Journal on selected areas in communications, 13(7):1176–1188, 1995.
•  S. Stüdli, E. Crisostomi, R. Middleton, and R. Shorten. Aimd-like algorithms for charging electric and plug-in hybrid vehicles. In Electric Vehicle Conference (IEVC), 2012 IEEE International, pages 1–8. IEEE, 2012.
•  S. Stüdli, E. Crisostomi, R. Middleton, and R. Shorten. A flexible distributed framework for realising electric and plug-in hybrid vehicle charging policies. International Journal of Control, 85(8):1130–1145, 2012.
•  M. Udell and S. Boyd. Maximizing a sum of sigmoids. Optimization and Engineering, 2013.
•  S. P. Vadhan et al. Pseudorandomness. Foundations and Trends® in Theoretical Computer Science, 7(1–3):1–336, 2012.
•  F. Wirth, S. Stüdli, J. Y. Yu, M. Corless, and R. Shorten. Nonhomogeneous place-dependent markov chains, unsynchronised aimd, and network utility maximization. arXiv preprint arXiv:1404.5064, 2014.
•  E. Xydas, C. Marmaras, and L.M. Cipcigan. A multi-agent based scheduling algorithm for adaptive electric vehicles charging. Applied Energy, 177:354–365, 2016.
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters   