Multi-Period Liability Clearing via Convex Optimal Control
We consider the problem of determining a sequence of payments among a set of entities that clear (if possible) the liabilities among them. We formulate this as an optimal control problem, which is convex when the objective function is, and therefore readily solved. For this optimal control problem, we give a number of useful and interesting convex costs and constraints that can be combined in any way for different applications. We describe a number of extensions, for example to handle unknown changes in cash and liabilities, to allow bailouts, to find the minimum time to clear the liabilities, or to minimize the number of non-cleared liabilities, when fully clearing the liabilities is impossible.
Code (1)
Similar Papers 제목 키워드 기반
Pricing Economic Dispatch with AC Power Flow via Local Multipliers and Conic Relaxation
We analyze pricing mechanisms in electricity markets with AC power flow equations that define a nonconvex feasible set for the economic dispatch problem. Specifically, we consider two possible pricing schemes. The first …
Convexifying Market Clearing of SoC-Dependent Bids from Merchant Storage Participants
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-conve…
Multi-Interval Energy-Reserve Co-Optimization with SoC-Dependent Bids from Battery Storage
We consider the problem of co-optimized energy-reserve market clearing with state-of-charge (SoC) dependent bids from battery storage participants. While SoC-dependent bids capture storage's degradation and opportunity c…
Optimal auction duration: A price formation viewpoint
We consider an auction market in which market makers fill the order book during a given time period while some other investors send market orders. We define the clearing price of the auction as the price maximizing the e…
Convexifying Regulation Market Clearing of State-of-Charge Dependent Bid
We consider the problem of merchant storage participating in the regulation market with state-of-charge (SoC) dependent bids. Because storage can simultaneously provide regulation up and regulation down capacities, the m…
Bilevel Optimization