2022
DOI: 10.1109/tpwrs.2021.3111869
|View full text |Cite
|
Sign up to set email alerts
|

An Asynchronous Online Negotiation Mechanism for Real-Time Peer-to-Peer Electricity Markets

Abstract: General rightsCopyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research.  You may not further distribute the material or use it for any profit-making activity or commer… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
6
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 25 publications
(8 citation statements)
references
References 49 publications
0
6
0
Order By: Relevance
“…This restriction ensures that the market clearing solution is consistent with former wholesale market solution. The imbalance of each area is calculated in (5) as the difference between the power output of the agents prior and after the market clearing [13]. The dual variable associated to this equation, λ imb t , represents the marginal costs for balancing products.…”
Section: Market Constraintsmentioning
confidence: 99%
See 1 more Smart Citation
“…This restriction ensures that the market clearing solution is consistent with former wholesale market solution. The imbalance of each area is calculated in (5) as the difference between the power output of the agents prior and after the market clearing [13]. The dual variable associated to this equation, λ imb t , represents the marginal costs for balancing products.…”
Section: Market Constraintsmentioning
confidence: 99%
“…The stopping criterion is presented in (33). Typical choices for ε ranges between 10 −2 and 10 −3 for complicating variables [5]. A flowchart of the decentralized Multi-Area LFM clearing problem is presented in Fig.…”
Section: Stopping Criterion and Clearing Algorithmmentioning
confidence: 99%
“…However, both processes are limited by suboptimality owing to the discretization issue mentioned above and exhibit an upper bounded gap in social welfare maximization. LR-Ms [1,2,5] require operation in the synchronous mode and are thus vulnerable to communication failures [5].…”
Section: Introductionmentioning
confidence: 99%
“…Thus, an online algorithm is desired. A straightforward approach is the greedy algorithm that decomposes the offline problem into subproblems in each time slot by neglecting the time-coupling constraints [23]. Obviously, the result could be far from optimum.…”
Section: Introductionmentioning
confidence: 99%