Convexifying Market Clearing of SoC-Dependent Bids from Merchant Storage Participants

09/05/2022
by   Cong Chen, et al.
0

State-of-charge (SoC) dependent bidding allows merchant storage participants to incorporate SoC-dependent operation and opportunity costs in a bid-based market clearing process. However, such a bid results in a non-convex cost function in the multi-interval economic dispatch and market clearing, limiting its implementation in practice. We show that a simple restriction on the bidding format removes the non-convexity, making the multi-interval dispatch of SoC-dependent bids a standard convex piece-wise linear program.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2022

Rate-Optimal Online Convex Optimization in Adaptive Linear Control

We consider the problem of controlling an unknown linear dynamical syste...
research
12/01/2011

Bandit Market Makers

We introduce a modular framework for market making. It combines cost-fun...
research
05/23/2019

Image Fusion via Sparse Regularization with Non-Convex Penalties

The L1 norm regularized least squares method is often used for finding s...
research
06/04/2021

Subgroup Fairness in Two-Sided Markets

It is well known that two-sided markets are unfair in a number of ways. ...
research
07/30/2014

Market Making with Decreasing Utility for Information

We study information elicitation in cost-function-based combinatorial pr...
research
12/06/2022

Finding the Right Curve: Optimal Design of Constant Function Market Makers

Constant Function Market Makers (CFMMs) are a crucial tool for creating ...
research
02/15/2021

Log-time Prediction Markets for Interval Securities

We design a prediction market to recover a complete and fully general pr...

Please sign up or login with your details

Forgot password? Click here to reset