IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.00541.html

Optimal Uniform Pricing for Multi-Interval Dispatch without Make-Whole Uplifts

Author

Listed:
  • Valentina Norambuena-Guzman
  • Cong Chen
  • Lang Tong
  • Timothy D. Mount

Abstract

In a network with ramp-limited generators and inaccurate net-demand forecasts, practical rolling-window dispatch can drive locational marginal prices (LMPs) below generators' bid-in offers. In such cases, out-of-market (OOM) settlements are used to compensate generators and maintain dispatch-following incentives, but OOM can have negative consequences, including nontransparent real-time price signals, discriminatory compensation, and incentives for untruthful bidding. This paper presents an optimal uniform pricing rule that minimizes demand payments, eliminates OOM make-whole payments, preserves LMP-based congestion charges, and ensures revenue adequacy. We derive the proposed pricing rule in closed form and relate it to existing pricing schemes. Numerical comparisons demonstrate favorable generator profits and reduced price volatility. However, higher generator profits are accompanied by increased demand payments, reflecting the in-market, uniform allocation of ramping costs while preserving the LMP-based congestion charges widely used in real-time market settlements. The numerical results also show that, under LMP with OOM settlement, a price-taking generator has an incentive to inflate its offer, whereas this incentive is absent under the proposed pricing rule within the tested bid range.

Suggested Citation

  • Valentina Norambuena-Guzman & Cong Chen & Lang Tong & Timothy D. Mount, 2026. "Optimal Uniform Pricing for Multi-Interval Dispatch without Make-Whole Uplifts," Papers 2609.00541, arXiv.org.
  • Handle: RePEc:arx:papers:2609.00541
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.00541
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2609.00541. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.