Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

471114 · May 202619922001200920172026
48 results for day-ahead bidding

Study finds CRPS learning doesn't improve day-ahead bidding profits despite better accuracy.

problem Improving day-ahead bidding profits through better probabilistic price forecasting.
method CRPS learning to minimize continuous ranked probability score (CRPS) for ensemble predictions.
result Higher diversity in ensemble predictions improves accuracy but doesn't lead to higher profits.

The paper analyzes profitable bidding strategies for BESS in day-ahead and intraday markets.

problem Optimizing profitability of Battery Energy Storage Systems (BESS) in day-ahead and intraday markets.
method Employing the rolling intrinsic approach to model continuous intraday markets, accounting for bid-ask spreads and liquidity constraints.
result Multi-market bidding strategies outperform single-market participation, and relaxing daily cycling constraints can unlock additional value.

Proposes a virtual bidding strategy for electricity markets using stochastic control.

problem Optimizing electricity prices in day-ahead and real-time markets.
method Modeling price differences as Brownian motion with meteorological variables, transforming into portfolio management problem.
result Developed a strategy to manage electricity prices efficiently.

Grid-scale batteries' bid patterns in price uncertainty markets

problem Interpreting bids from grid-scale batteries in wholesale electricity markets under price uncertainty
method Developing an asset-level model of a price-taking battery
result Empirical results deliver insights into withholding behavior, uncertainty effects, and risk management reshaping bid curves

Novel approach predicts long-term seasonal component of electricity prices for improved forecasting.

problem Improving day-ahead electricity price forecasting accuracy.
method Extracts trend-seasonal pattern from extrapolated price series using autoregressive and LASSO models.
result Improves predictive accuracy by 3-15% in root mean squared error and 1% in profits.

Optimizes bidding in hourly and quarter-hourly electricity markets to reduce price impact.

problem Maximizing profit in two consecutive electricity markets with market impact and transaction costs.
method Examined multiple price scenarios, estimated market impact, used trading strategies, provided theoretical results.
result Minimizing price impact is more profitable than maximizing arbitrage in the German EPEX market.

Study compares two market clearing methods for European power markets.

problem Optimizing market clearing for European power markets considering cost and social welfare.
method Introduces Cost Minimization and Social Welfare Maximization models, and four algorithms to solve the CM model.
result Cost Minimization reduces market power and decreases total procurement cost.

Model predicts and optimizes trading of electricity price spreads across multiple zones.

problem Forecasting and optimizing day-ahead versus real-time price spreads in U.S. electricity markets.
method Unified statistical model for positive and negative spikes, structural price impact model based on bid stacks.
result Optimal trading strategy improves risk-return profile and highlights market heterogeneity.

Paper uses conformal prediction for solar power forecasting in electricity markets.

problem Enhancing participation in electricity markets through accurate day-ahead PV power predictions.
method Combines machine learning for point predictions and conformal prediction for uncertainty quantification.
result CP with k-nearest neighbors and Mondrian binning outperforms linear quantile regressors in predicting PV power.

Overprocuring reserves can improve network efficiency by using excess reserves for congestion management.

problem Optimizing energy and reserve allocation between zones to minimize costs and ensure deliverability.
method Developed allocation models for co-allocating traded energy and reserve products, considering both deterministic and stochastic flows.
result Excess reserve supplies can be used for congestion management, leading to additional network benefits.

Deep learning framework for bond and yield curve forecasting with no-arbitrage constraints.

problem Arbitrage-free yield curve and bond price forecasting.
method Combines Kalman, extended Kalman, and particle filters with LSTM/CLSTM, and introduces AER term.
result Arbitrage regularization improves forecast accuracy, especially at short maturities.

A winning method for day-ahead electricity demand forecasting during and after the COVID-19 pandemic.

problem Day-ahead electricity demand forecasting during and after the COVID-19 pandemic.
method Online forecast combination of multiple point prediction models with a holiday adjustment procedure and smoothed Bernstein Online Aggregation (BOA).
result Excellent forecasting performance, particularly due to the holiday adjustment procedure and fully adaptive smoothed BOA approach.

We consider a class of auctions (Lowest Unique Bid Auctions) that have achieved a considerable success on the Internet. Bids are made in cents (of euro) and every bidder can bid as many numbers as she wants. The lowest unique bid wins the auction. Every bid has a fixed cost, and once a participant makes a bid, she gets…

2010-07-24abs ↗pdf ↗

A new relaxed framework for pricing illiquid derivatives using bid-ask spreads.

problem Pricing illiquid derivatives with realistic bounds and hedging prices.
method Introducing Bid--Ask Martingale Optimal Transport (BAMOT) that relaxes the exact calibration of model marginals to mid-prices of vanilla options.
result BAMOT yields realistic price bounds and superhedging prices for illiquid derivatives.

Algorithm learns to bid in auctions with shilling, masking real bids.

problem Learning to bid in auctions manipulated by shilling.
method Combines interval-elimination and optimistic branches, debiases losing-side reports.
result Achieves dynamic-pricing rate ildeO(T2/3) ilde{\mathcal{O}}(T^{2/3}) and first-price auctions rate ildeO(T) ilde{\mathcal{O}}(\sqrt{T}).

BiCB combines traffic prediction and bidding optimization for live advertising.

problem Real-time bidding in live advertising with unknown future traffic.
method Binary Constrained Bidding (BiCB) that merges mathematical analysis and statistical traffic estimation.
result BiCB achieves good approximation to optimal bidding results with low complexity.

This paper tackles optimal bidding strategies in adversarial first-price auctions.

problem How to bid optimally and efficiently in adversarial first-price auctions.
method Developed a minimax optimal online bidding algorithm leveraging expert-chaining structure and exploiting product structure.
result Achieved an O~(T)\widetilde{O}(\sqrt{T}) regret, superior to existing algorithms.

THieF improves day-ahead electricity price prediction accuracy by reconciling hourly and block forecasts.

problem Improving accuracy in predicting day-ahead electricity prices.
method Temporal hierarchy forecasting (THieF) reconciling hourly and block forecasts.
result THieF significantly improves accuracy (up to 13%) at all levels of prediction.

Models of auctions or tendering processes are introduced. In every round of bidding the players select their bid from a probability distribution and whenever a bid is unsuccessful, it is discarded and replaced. For simple models, the probability distributions evolve to a stationary power law with the exponent dependent…

2001-02-12abs ↗pdf ↗

Optimizes RTB bidding without exploration, improving performance under various budgets.

problem Lack of clear evaluation and generalization issues in RTB systems.
method Maximum entropy principle and conditional independence structures to train a model that generalizes to unseen budget conditions.
result Significantly improved performance under various budget settings compared to baselines.

The paper proposes a new method to forecast winning prices in real-time bidding.

problem Accurately forecasting winning prices in real-time bidding with limited data.
method The paper introduces a heteroscedastic fully parametric censored regression approach and a mixture density censored network.
result The proposed method significantly improves winning price forecasting compared to existing methods.

In this paper a finite discrete time market with an arbitrary state space and bid-ask spreads is considered. The notion of an equivalent bid-ask martingale measure (EBAMM) is introduced and the fundamental theorem of asset pricing is proved using (EBAMM) as an equivalent condition for no-arbitrage. The Cox-Ross-Rubinst…

2014-07-12abs ↗pdf ↗

Statistical depth metrics help identify risky power grid scenarios.

problem Identifying extreme scenarios for risk mitigation in power grid planning.
method Functional depth metrics for sub-selecting outlying scenarios.
result The proposed approach effectively identifies risky scenarios for operational risk mitigation.

Deep learning detects bid-rigging cartels with high accuracy.

problem Detecting bid-rigging cartels using pairwise bidding interactions.
method Convolutional neural networks applied to graphs of normalized bid values.
result Convolutional neural networks achieve around 90% accuracy in classifying collusive and competitive bidding interactions.

Taobao, as the largest online retail platform in the world, provides billions of online display advertising impressions for millions of advertisers every day. For commercial purposes, the advertisers bid for specific spots and target crowds to compete for business traffic. The platform chooses the most suitable ads to …

2017-02-27abs ↗pdf ↗

Model predicts bid and ask price dynamics with spread-dependent intensities.

problem Predicting bid and ask price dynamics in high-frequency stock markets.
method Extended Hawkes process with zero intensities, spread-dependent intensities, and negative excitement.
result Spread-narrowing tendency, excitations caused by previous events, impact of flash crashes, and different market participant features.

Quantum theory explains price dynamics in financial markets, capturing bid-ask spread and ergodicity.

problem Nature of price formation in financial markets and bid-ask spread dynamics.
method Developed a quantum coupled-wave theory using a 2x2 price operator with eigenvalues representing bid and ask prices.
result The theory adequately models bid-ask spread and directional price movement due to quantum-chaotic interaction.

Improved power arbitrage through domain-adapted reinforcement learning.

problem Optimizing profit in the Dutch power market through arbitrage opportunities.
method Dual-agent reinforcement learning with imitation of power traders' behaviors.
result Significant improvement in cumulative profit and loss (P&L) with a three-fold increase.

Paper uses reinforcement learning to optimize bid-ask spreads in OTC markets.

problem Optimizing bid-ask spreads in over-the-counter markets with dynamic order sizes.
method Reinforcement learning to solve high-dimensional stochastic control problem.
result Optimal bid-ask spreads follow a Gaussian distribution under certain conditions.

This paper improves bidding price prediction for ancillary services markets, boosting revenues.

problem Volatility in renewable energy sources affects grid stability and revenue optimization.
method Machine learning models (SVR, DT, k-NN) and offset adjustment for pay-as-bid markets.
result The proposed approach increases potential revenues by 27.43% to 37.31% compared to baseline models.

This work optimizes bid strategies for online auctions using measure-valued optimization.

problem Optimizing bid strategies in first-price auctions to maximize expected surplus.
method Formulates the problem as convex optimization over the joint distribution of shading parameters, adapts the distribution after each auction using a Wasserstein-proximal update.
result The proposed algorithm encourages bids on values with high expected surplus.