A distributed game theoretic approach to energy trading in the smart grid
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
This paper propose a distributed game where energy is traded between multiple smart grid users. More precisely, a number of geographically distributed consumers may have a surplus of energy for sale while others need to buy energy to meet their local demands. Sellers make profit by selling their surplus of energy stored in storage devices such as electric vehicle batteries. Buyers can save on their energy bill by buying energy from their neighbors, instead of the grid, at a lower price, which also decreases the load on the grid. Under this proposed approach, buyers play a game by deciding how much energy they will buy from each seller in order to minimize their energy bill while taking into consideration energy transmission cost. The proposed approach is evaluated through a set of simulations, where the attained energy bill of buyers as well as the convergence rate are shown for different scenarios. To confirm the effectiveness of the proposed game, we compare the results to those of a centralized optimization model.
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.
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.000 | 0.000 |
| 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 it