Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1901.01927

Price-Coupling Games and the Generation Expansion Planning Problem

Mathew P. Abraham·Ankur A. Kulkarni
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we introduce and study a class of games called price-coupling games that arise in many scenarios, especially in the electricity industry. In a price-coupling game, there is a part of the objective function of a player which has an identical form for all players and there is coupling in the cost functions of players through a price which is determined uniformly for all players by an independent entity called the \textit{price-determining player} (e.g. independent system operator (ISO) in an electricity market). This price appears in the objective function only in the part which is identical for all players. We study the existence of equilibria in such games under two broad categories, namely \textit{price-anticipative} and \textit{price-taking} formulations. In the price-anticipative formulation, the players anticipate the price and make their decisions while in the price-taking formulation, the players make their decisions considering the price as a given parameter. We model the price-anticipative case as a leader-follower formulation where the players (leaders) conjecture the price (follower's decision) and make their decision. The price-taking formulation is modelled as an $N+1$ player game with the additional player as the price-determining player. The existence of an equilibrium in such games are not easy mainly because of the coupled-constraint structure of the game and the non-convexity of the action set. We give conditions for the existence of equilibria in both formulations. We apply our results to analyze the existence of an equilibrium in the generation expansion planning problem using the above results.

Explore related subjects

math.OCcs.GT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mathew P. Abraham, Ankur A. Kulkarni. 2019-01-07. Price-Coupling Games and the Generation Expansion Planning Problem. https://arxiv.org/abs/1901.01927

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Operational Impact of Registry size, Cycle length, and Blood Type Distribution in Multi-Registry Kidney Exchange Programs

Kidney exchange programs address donor recipient incompatibility by exchanging donors between incompatible pairs, but single center KEPs often suffer from limited donor pools, which reduce matching efficiency. Multi registry kidney exchange programs offer a promising solution but face challenges, including heterogeneous constraints across registries, cycle-length bounds, and data-sharing limitations. This study uses simulation to compare mKEP allocation against individual registry operation, contrasting unconstrained pooling with two safeguarded mechanisms: a cumulative individual-rationality guarantee and a Shapley value based fair-share mechanism. We examine how registry size, blood-type distribution, cycle-length bounds, and dropout probability affect the size and distribution of achievable gain. Our central finding is that the benefit of joining an mKEP is systematically uneven: under blood group composition asymmetry, the easier-to-match registry gains less than its partner even under both safeguarded mechanisms, and a larger registry gains less than a smaller one when pooled. A registry combining a larger arrival rate with an easier-to-match pool may see its gain under either safeguarded mechanism fall too small to be practically significant, while registries with a higher dropout rate see a larger benefit from pooling. This unevenness concentrates in O-type recipients: an easier-to-match registry sees fewer O-type transplants within itself under pooling, though O-type transplant rates rise system-wide. Tighter cycle-length bounds increase, rather than diminish, the relative transplant-volume benefit of pooling, while match quality is only modestly affected by any factor examined. These results highlight the importance of pairing multi-registry collaboration with a carefully designed, equitable benefit-sharing mechanism to keep participation attractive for all registries involved.

math.OC↗
arXiv2026

A polynomial approximation scheme for nonlinear model reduction by moment matching

We propose a procedure for the numerical approximation of invariance equations arising in the moment matching technique associated with reduced-order modeling of high-dimensional dynamical systems. The Galerkin residual method is employed to find an approximate solution to the invariance equation using a Newton iteration on the coefficients of a monomial basis expansion of the solution. These solutions to the invariance equations can then be used to construct reduced-order models. We assess the ability of the method to solve the invariance PDE system as well as to achieve moment matching and recover the steady-state behaviour of nonlinear systems with state dimension of order 1000 driven by linear and nonlinear signal generators.

math.OC↗
arXiv2026

Computationally Efficient Density-Driven Optimal Control via Analytical KKT Reduction and Contractive MPC

Efficient coordination for collective spatial distribution is a fundamental challenge in multi-agent systems. Prior research on Density-Driven Optimal Control (D2OC) established a framework to match agent trajectories to a desired spatial distribution. However, implementing this as a predictive controller requires solving a large-scale Karush-Kuhn-Tucker (KKT) system, whose computational complexity grows cubically with the prediction horizon. To resolve this, we propose an analytical structural reduction that transforms the T-horizon KKT system into a condensed quadratic program (QP). This formulation achieves O(T) linear scalability, significantly reducing the online computational burden compared to conventional O(T^3) approaches. Furthermore, to ensure rigorous convergence in dynamic environments, we incorporate a contractive Lyapunov constraint and prove the Input-to-State Stability (ISS) of the closed-loop system against reference propagation drift. Numerical simulations verify that the proposed method facilitates rapid density coverage with substantial computational speed-up, enabling long-horizon predictive control for large-scale multi-agent swarms.

math.OC↗