Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1512.04051

Calibration algorithm for spatial partial equilibrium models with conjectural variations

Tobias Baltensperger·Rudolf M. Füchslin·Pius Krütli·John Lygeros
View original source ↗Read source document ↗Export metadata ↓

Abstract

When calibrating spatial partial equilibrium models with conjectural variations, some modelers fit the suppliers' sales to the available data in addition to total consumption and price levels. While this certainly enhances the quality of the calibration, it makes it difficult to accommodate user-imposed bounds on the model parameters such as restricting the market power parameters to the interval [0,1], which is a common requirement in conjectural variations approaches. We propose an algorithm to calibrate the suppliers' sales and simultaneously deal with user-defined bounds on parameters. To this end, we fix the suppliers' sales at reference values and obtain the marginal costs for each supplier and market. We then limit the market power parameters to the interval [0,1], and calculate intervals of anchor prices and price elasticities that reproduce the reference supplier sales in the state of equilibrium. If these intervals do not contain the reference price elasticities and prices, we face a mismatch between reality and the model mechanics. We resolve this by altering the reference sales for the critical suppliers, and iterate. Thereby, the user controls whether price elasticities and anchor prices should be close to their reference values, or the suppliers' sales. The algorithm is tested on data from the European gas market, and required less than one minute to identify calibrated parameters. Our algorithm is widely applicable, since it is based on mild (and common) underlying assumptions and can be configured to suit a specific purpose thanks to the inclusion of user-defined bounds on all relevant parameters.

Explore related subjects

math.OC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tobias Baltensperger, Rudolf M. Füchslin, Pius Krütli, John Lygeros. 2015-12-16. Calibration algorithm for spatial partial equilibrium models with conjectural variations. https://arxiv.org/abs/1512.04051

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

KEEP EXPLORING

Related papers

arXiv2026

AdGT: Decentralized Gradient Tracking with Adaptive Per-Agent Stepsizes

In decentralized optimization, gradient-tracking methods typically rely on a single global stepsize. This choice can be conservative when agents have local objectives with different smoothness constants, since the stepsize must remain stable for the agent with the largest smoothness constant. This paper proposes AdGT, a decentralized gradient-tracking method in which each agent adapts its own stepsize using local gradient variation and a single global safety factor. The method reduces fixed-stepsize tuning effort and allows agents to exploit local smoothness information during the iterations. For smooth and strongly convex local objectives over undirected networks, we prove that the analyzed AdGT update converges linearly to the exact consensus optimizer. We also study two adaptive stepsize updates that use changes in the gradient-tracking direction. We characterize when the corresponding candidate determines the stepsize and prove conditional lower and upper stepsize bounds and linear convergence under an additional relative tracking-disagreement condition. Experiments on logistic regression, ridge regression, synthetic quadratic problems, and a linear-regression benchmark against state-of-the-art decentralized solvers show that AdGT often reaches a given accuracy in fewer iterations or gradient evaluations than tuned fixed-stepsize GT and the tested baselines, especially under heterogeneous local smoothness. In the topology experiments, each tested AdGT update uses one common safety factor across all graphs, whereas the fixed GT stepsize is tuned separately for each graph and seed.

math.OC↗
arXiv2026

Brockett cost function for symplectic eigenvalues

The sum of symplectic eigenvalues and corresponding eigenvectors of symmetric positive-definite matrices in the sense of Williamson's theorem can be computed via minimization of a trace cost function under the symplecticity constraint. Optimal solutions to this problem only offer a symplectic basis for the symplectic eigenspace corresponding to the sought symplectic eigenvalues. In this note, we introduce a Brockett cost function and investigate its properties and the connection with the symplectic eigenvalues and eigenvectors of the considered matrix. Specifically, we prove that any stationary point consists of symplectic eigenvectors, characterize the saddle points and global minimizers based on which the trace minimization theorem for the symplectic eigenvalues is re-established, and the nonexistence of local nonglobal minimizers is justified.

math.OC↗
arXiv2026

Riemannian Bilevel Optimization with Gradient Aggregation

We study bilevel optimization on Riemannian manifolds when the lower-level solution set is a positive-dimensional submanifold, so that implicit differentiation fails. We propose Riemannian Bilevel Descent Aggregation (RBDA), which extends bilevel descent aggregation to manifolds. Its inner loop aggregates the lower-level descent direction with the upper-level gradient under a decaying multiplier, and its hypergradient is the reverse-mode derivative of the unrolled loop. Under geodesic convexity and quadratic growth of the lower level, the inner iterates converge to a point of the optimistic solution set at a polynomial rate. Approximate minimizers of the objective with a finite number of inner iterations converge to minimizers of the optimistic value. In the experiments RBDA selects the optimistic solution where the implicit and unrolled estimators remain at the initial point or stop at a larger query loss. While each of its outer steps costs more than that of the unrolled estimator, it attains the highest test accuracy in data hyper-cleaning.

math.OC↗