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,695 papers · 148 categories

Trend · papers per month

35810 · Jun 202019922001200920172026
48 results for Day-ahead auction

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.

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.

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 improves forecasting of aggregated curves in electricity markets.

problem Improving accuracy in predicting aggregated curves like demand and supply in electricity markets.
method Exploits hierarchical structure of aggregated curves, uses reconciliation methods (bottom-up, top-down, linear optimal, aggregated-down).
result Hierarchical reconciliation methods can significantly improve forecast accuracy of aggregated curves.

Neural networks outperform single-hour models in day-ahead electricity price forecasting.

problem Improving accuracy in day-ahead electricity price forecasting.
method Compared two neural network structures: one-hour models and daily auction models.
result Daily auction models outperform one-hour models in forecasting accuracy.

Study shows different price correlations in European electricity markets.

problem Stochastic variability and temporal correlation in electricity prices.
method Comparison of Detrended Fluctuation Analysis (DFA) and Kramers--Moyal equation.
result Intraday 15 minutes spot markets show strong negative correlations, unlike other markets.

Paper models and forecasts intra-day electricity price spreads.

problem Forecasting intra-day price spreads for electricity traders and operators.
method Dynamic density functions based on skewed-t distributions, conditional on exogenous drivers.
result Best fitting and forecasting specifications selected using Pinball Loss function.

The liberalization of electricity markets and the development of renewable energy sources has led to new challenges for decision makers. These challenges are accompanied by an increasing uncertainty about future electricity price movements. The increasing amount of papers, which aim to model and predict electricity pri…

2017-03-31abs ↗pdf ↗

We provide an exact analytical solution of the Nash equilibrium for kk- price auctions. We also introduce a new type of auction and demonstrate that it has fair solutions other than the second price auctions, therefore paving the way for replacing second price auctions.

2018-09-26abs ↗pdf ↗

The paper tackles auction market design flaws by randomizing closing times and optimizing transaction fees.

problem Strategic traders exploit accumulated information to delay their orders, distorting auction efficiency.
method Randomizing auction closing times and designing optimal transaction fees policies.
result Policies encourage strategic traders to send orders earlier, improving auction market efficiency.

The study compares uniform-price and discriminatory auctions in terms of learning difficulty.

problem Comparing the learning difficulty of uniform-price and discriminatory multi-unit auctions.
method Characterization of learning difficulty through regret minimization in both full-information and bandit feedback settings.
result Regret scales similarly for both auction formats under full-information, but uniform-price auctions can achieve faster learning rates.

We first investigate the evolution of opening and closing auctions volumes of US equities along the years. We then report dynamical properties of pre-auction periods: the indicative match price is strongly mean-reverting because the imbalance is; the final auction price reacts to a single auction order placement or can…

2018-02-06abs ↗pdf ↗

AHEAD improves financial market efficiency through ad-hoc auctions.

problem Improving financial market efficiency and reducing transaction costs.
method Introducing a new matching design (AHEAD) for electronic markets where participants can trade at a fixed price and trigger auctions when unsatisfied.
result A Nash equilibrium is achieved in the market, and ad-hoc auctions are more relevant and efficient than periodic auctions and continuous limit order books.

Study on heavy tails in closing auction returns, explaining imbalance through limit order submission.

problem Understanding heavy tails in closing auction return distributions.
method Used the stochastic call auction model of Derksen et al. (2020a) to derive and verify a relation between tail exponents.
result Large closing price fluctuations are not caused by large market orders, but by imbalance in limit orders.

Study on efficiency of Dutch auctions on blockchains considering various parameters.

problem Efficiency and fairness in Dutch auctions on blockchains.
method Modeling Dutch auctions with Poisson process and geometric Brownian motion, computing expected losses and time-to-fill.
result Tradeoff between speed and quality in Dutch auctions, useful for setting parameters.

Optimal bidding strategy for multi-platform ad auctions under budget constraints.

problem Optimizing ad placements for budget-constrained advertisers across multiple platforms.
method Developed an optimal bidding strategy for non-incentive-compatible auctions with budget constraints.
result Maximized total utility across auctions while satisfying budget constraints in expectation.

MiFID II impacts European stock liquidity and price formation.

problem Impact of MiFID II on European stock liquidity and price formation.
method Analyzed effects of MiFID II on European stock markets, focusing on intraday and closing auction liquidity and tick size changes.
result Closing auction volumes increased and price formation became more efficient after MiFID II.

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.

Study adapts liquidity model to equity auctions, revealing accelerated event rates and reduced price impact.

problem Understanding and predicting price dynamics in equity auctions.
method Adapted latent/revealed order book framework to equity auctions, measuring order submissions, cancellations, and diffusion rates.
result Equity auctions exhibit accelerated event rates leading to reduced price impact and decreased volatility.

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.

Proposes a framework for modeling RTB auctions using point processes.

problem Modeling and optimizing repeated auctions in the RTB ecosystem.
method Develops a stochastic framework using point processes to model and optimize RTB auctions.
result The proposed framework can be approximated to a Poisson point process, enabling the use of established properties.

The paper examines how builders in Ethereum auctions can defect and replicate winning MEV opportunities, affecting searchers' bidding strategies.

problem Commitment problem in Ethereum auctions where builders can defect and replicate winning MEV opportunities.
method Modeling and analysis of searchers' bidding strategies and the resulting equilibrium, using libMEV dataset.
result The equilibrium is piecewise, with the cost of imperfect commitment depending on replicability and competition. There is sharp heterogeneity across MEV types.

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 ↗

Optimizes reserve prices for first-price auctions to maximize revenue.

problem Optimizing reserve prices for first-price auctions in display advertising.
method Gradient-based algorithm to adaptively update and optimize reserve prices based on bidder responsiveness to experimental shocks.
result Revenue optimization in first-price auctions can be decomposed into demand and bidding components, and techniques are introduced to reduce variance of each.

We develop extensions to auction theory results that are useful in real life scenarios. 1. Since valuations are generally positive we first develop approximations using the log-normal distribution. This would be useful for many finance related auction settings since asset prices are usually non-negative. 2. We formulat…

2018-09-25abs ↗pdf ↗

Algorithm learns to bid optimally in repeated first-price auctions with censored feedback.

problem Learning to bid optimally in repeated first-price auctions with incomplete feedback.
method Developed an algorithm exploiting the specific feedback structure and payoff function of first-price auctions.
result Achieved a near-optimal O~(T)\widetilde{O}(\sqrt{T}) regret bound for first-price auctions.

Permutation-equivariant neural networks improve auction mechanisms by reducing regret and sample complexity.

problem Designing optimal auction mechanisms that balance revenue and bidders' regret.
method Introduced permutation-equivariant neural networks to auction mechanisms.
result Permutation-equivariant neural networks decrease expected ex-post regret and improve model generalizability.

Study learns optimal bidding strategy in auctions with dynamic values and aggregated feedback.

problem Optimizing bidding in auctions with time-dependent values and limited feedback.
method Combines plug-in estimators with differential-equation characterization of optimal policy.
result Achieves near optimal regret bounds for learning optimal policy.

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.

Study optimal auction formats for maximizing MEV on Ethereum.

problem Maximizing extractable value from Ethereum auctions.
method Empirical analysis of 2.2 million transactions, modeling affiliation among bidders.
result English and second-price sealed-bid auctions dominate other formats, with significant revenue losses.