Richard Mahuze, Charlotte Gressel, Ali Amadeh et al.
Rapid growth of large loads led by data centers is straining grid capacity. These loads increasingly accept curtailment risk through non-firm interconnection agreements to gain faster grid access, expanding the pool of consumers subject to mandatory disconnection during supply shortfalls. Yet, blunt rules assign curtailment without reference to the wide variation in the value consumers place on avoiding curtailment, often captured by the value of lost load (VOLL). This paper introduces the network-constrained Curtailment Credit Market (CCM), a mechanism in which agents submit bids that determine bilateral credit flows, subject to transmission network constraints. We prove that the bilateral credit flow representation can reach every curtailment allocation available to an omniscient central planner (feasible-set equivalence), so the bilateral flow structure introduces no loss of allocative capability. Under truthful bidding, the CCM achieves the planner's total value of served load, matching the planner's allocative benchmark when bids reflect true interruption costs. The CCM is formulated as a bilevel clearing problem that admits an exact single-level mixed-integer linear program (MILP), solved in 0.01 to 83 seconds. Numerical experiments on three test systems validate the mechanism at increasing scale and complexity: a 3-bus toy network that isolates the core trading logic, the IEEE 24-bus reliability test system as a standard benchmark, and a reduced New York (NY) grid that captures coordination across NY load zones. Our simulations show that the CCM increases the total value of served load by 1.24 to 1.83 times relative to pro-rata curtailment. On the three test systems examined here, no participant is worse off under incentive-compatible benchmark payments than under the administrative baseline.