This paper presents a game theoretic decentralized electric vehicle charging schedule for minimizing the customers' payments, maximizing the grid efficiency, and providing maximum potential capacity for ancillary services. Most of the available methods for electric vehicle charging assume that the customers are rational, there is low-latency perfect two-way communication infrastructure without communication/computation limitation between the distribution company and all the customers, and they have perfect knowledge about the system parameters. To avoid these strong assumptions and preserve the customers' privacy, we take advantages of the regret matching and the Nash Folk theorems. In the considered game, the players (customers) interact and communicate locally with only their neighbors. We propose a mechanism for this game which results in a full Nash Folk theorem. We demonstrate and prove that the on-off charging strategy provides maximum regulation capacity. However, our mechanism is quite general, takes into account the battery characteristics and degradation costs of the vehicles, provides a real time dynamic pricing model, and supports the vehicle-to-grid (V2G) and modulated charging protocols. Moreover, the developed mechanism is robust to the data disruptions and takes into account the long/short term uncertainties.

Joint energy consumption and trading management is still a major challenge in smart (micro-) grids. The main goal of solving such problems is to flatten the aggregate power consumption-generation curve and increase the local direct power trading among the participants as much as possible. Here, an inclusive formulation for energy management and trading of a Micro/Nano-grid (M/NG) is proposed. Subsequently, a holistic solution to jointly optimizing the internal energy consumption management and external local energy trading for a smart grid including several M/NGs is provided. As the problem is computationally intractable, the proposed approach involves three hierarchical stages. Firstly, a game-theoretic online stochastic energy management model is provided with a reinforcement learning solution by which the M/NGs can schedule their power consumptions. Secondly, an effective incentive-compatible doubleauction is formulated by which the M/NGs can directly trade with each other. Thirdly, the central controller develops an optimal power allocation program to reduce the power transmission loss and the destructive effects of local energy trading. The simulation results validate the efficiency of the proposed framework.

A novel pricing and scheduling mechanism is proposed in this paper for plug-in electric vehicles (PEVs) charging/discharging to track and synchronize with a renewable power generation pattern. Moreover, the proposed mechanism can be used in the demand-side management and ancillary service applications for the peak shaving and frequency regulation responding, respectively. We design a fully distributed stochastic optimization mechanism using a Bayesian pure strategic repeated game by which the PEVs optimally schedule their demands. We also use a mixed Bayesian-diffusion-Kalman filtering strategy for the customers to collaboratively estimate and track the stochastic price and regulation signals for the upcoming scheduling window. In this paper, all the characteristics of the PEVs as well as the uncertainty about their deriving patterns are considered. As our framework converges to an equilibrium even with incomplete information, it is agent-based, and the agents share the information only with their optional neighbors, it is scale free, robust, and secure.

The performance of partial diffusion Kalman filtering (PDKF) algorithm for the networks with noisy links is studied here. A closed-form expression for the steady-state mean square deviation is then derived and theoretically shown that when the links are noisy, the communication-performance tradeoff, reported for the PDKF algorithm, does not hold. Additionally, optimal selection of combination weights is investigated and a combination rule along with an adaptive implementation is motivated. The results confirm the theoretical outcome.

Demand side energy consumption scheduling is a well-known issue in the smart grid research area. However, there is lack of a comprehensive method to manage the demand side and consumer behavior in order to obtain an optimum solution. The method needs to address several aspects, including the scale-free requirement and distributed nature of the problem, consideration of renewable resources, allowing consumers to sell electricity back to the main grid, and adaptivity to a local change in the solution point. In addition, the model should allow compensation to consumers and ensurance of certain satisfaction levels. To tackle these issues, this paper proposes a novel autonomous demand side management technique which minimizes consumer utility costs and maximizes consumer comfort levels in a fully distributed manner. The technique uses a new logarithmic cost function and allows consumers to sell excess electricity (e.g. from renewable resources) back to the grid in order to reduce their electric utility bill. To develop the proposed scheme, we first formulate the problem as a constrained convex minimization problem. Then, it is converted to an unconstrained version using the segmentation-based penalty method. At each consumer location, we deploy an adaptive diffusion approach to obtain the solution in a distributed fashion. The use of adaptive diffusion makes it possible for consumers to find the optimum energy consumption schedule with a small number of information exchanges. Moreover, the proposed method is able to track drifts resulting from changes in the price parameters and consumer preferences. Simulations and numerical results show that our framework can reduce the total load demand peaks, lower the consumer utility bill, and improve the consumer comfort level.