A Discounted Stochastic Multiplayer Game Approach for Vehicle-to-Grid Voltage Regulation
Bibliographic record
Abstract
Along with the diversification of electricity market, the voltage regulation (VR) service is opened up to various qualified providers to meet the enormous demand, among which, the electric vehicle (EV) aggregators (AGGs) can integrate the scattered EVs and play the role of VR sources with a high response speed and low cost. In order to coordinate the VR service providers to satisfy the total VR requirement, auction mechanisms are widely used to select VR sources to achieve better performance. Yet, it is challenging to optimize the strategy of each EV AGG in the auction process due to the stochastic EV mobility, various distribution network topology, and the competition mechanism. To address these challenges, we proposed a discounted stochastic multiplayer game (DSMG) approach to analyze the competition among EV AGGs. Due to the constraint of distribution network topology, the efficiency of the VR sources at different locations can be different. Thus, the impact of distribution network topology on the VR efficiency is investigated by DSO when evaluating the capacity of AGGs. The randomness of EV numbers is considered when predicting the AGGs' available VR capacity so that the tendency for the AGGs to follow the optimal strategies can be modeled accurately. Accordingly, a linear power flow analysis approach and a battery pool model are developed to address the distribution network topology and EV mobility, respectively. Then, the DSMG approach is used in the VR auction process to optimize the AGGs' strategies. The existence proof of the stationary Markov perfect equilibrium is presented, and the corresponding algorithms to obtain the equilibrium is proposed. The performance of the proposed DSMG approach is evaluated and compared with other approaches based on the IEEE 33-bus test feeder, IEEE 123-bus test feeder, and the real-world generation and load data from PVWatts Calculator and Market Analysis and Information System, respectively.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".