A novel iterative double auction design and simulation platform for packetized energy trading of prosumers in a residential microgrid
Bibliographic record
Abstract
Abstract Packetized energy encapsulates energy into modulated, routable, and trackable energy packets, enhancing the flexibility of managing distributed energy resources and expediting prosumers’ participation in transactive energy markets. In the context of packetized energy trading (PET), energy prosumers are naturally deemed as self‐interested agents seeking to obtain their own benefits. To align with prosumers’ demand, supply, quality of service (QoS), and system‐level social welfare, it is necessary to explore the design of prosumers’ bidding strategies and the market clearing methods, considering prosumers’ utility and the best demand response to markets. This study addresses challenges arising from prosumers’ selfishness and asymmetric preferences by proposing a PET‐oriented iterative double auction (IDA‐PET) design, where prosumers are allowed to iteratively change the bids before the auctioneer clears the market. Moreover, IDA‐PET accommodates system capacity constraints, energy balance, and economic constraints, providing cooperative strategies for both prosumers and the auctioneer. To validate the effectiveness of IDA‐PET, a novel and dedicated co‐simulation platform based on the hierarchical engine for large‐scale infrastructure co‐simulation platform is developed and case studies are conducted within a residential microgrid. The simulation results demonstrate that IDA‐PET can efficiently enhance the revenue of the auction market while meeting prosumers’ QoS requirements.
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 machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 source (direct Gemma or distilled Codex), 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".