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

1122 · Apr 201219922001200920172026
20 results for price-setting

Risk hedging can reduce operational costs by adjusting prices and production levels in response to asset price movements.

problem How risk hedging impacts operational decisions in response to asset price movements.
method Developed and solved a risk-management model integrating risk hedging into a price-setting newsvendor problem.
result Hedging generally reduces optimal price and VPQ, but may increase VPQ under certain conditions.

We introduce a general framework for continuous-time betting markets, in which a bookmaker can dynamically control the prices of bets on outcomes of random events. In turn, the prices set by the bookmaker affect the rate or intensity of bets placed by gamblers. The bookmaker seeks a price process that maximizes his exp…

2019-07-01abs ↗pdf ↗

Study finds non-monotonic Value of Information in dynamic multi-market monopoly.

problem Investigates non-monotonicity in Value of Information for a price-setting monopolist.
method Uses a Bayesian inverse problem with Kalman-Bucy-Stratonovich filter in a dynamic discrete model.
result Non-monotonic relationship between signal variance and Value of Information.

Retail investors set interest rates for P2P loans based on borrower characteristics.

problem Understanding how individual investors price credit risk in online consumer loan auctions.
method Reverse auction framework, analyzing interest rate variance and borrower characteristics.
result Retail investors exhibit strong predictability in pricing, with gender and marital status influencing interest rates.

Study examines pricing strategies in competitive supply chains with discrete prices.

problem Inaccurate assumptions in traditional SC models for pricing decisions.
method Examines a SC model with one supplier and two manufacturers, considering customer demand segmentation and discrete price setting.
result Nash equilibria among manufacturers are not unique, and low denomination factors can lead to instability.

In two previous papers the author developed a second-order price adjustment (tâtonnement) process. This paper extends the approach to include both quantity and price adjustments. We demonstrate three results: a analogue to physical energy, called "activity" arises naturally in the model, and is not conserved in general…

2012-04-14abs ↗pdf ↗

The paper tackles adaptive policy selection to maximize social welfare, achieving optimal regret bounds.

problem Maximizing social welfare through adaptive policy selection, considering both private utility and public revenue.
method The approach involves learning response functions through experimentation, deriving lower and upper bounds for regret, and using algorithms like Exp3.
result The algorithm achieves optimal regret bounds, showing that welfare maximization is harder than multi-armed bandit problems.

Unified deep sequential and state-space models for robust option pricing with uncertainty.

problem Combining robustness to noise and uncertainty measurement in option pricing models.
method Unscattered reservoir smoother (URS) integrating deep sequential and state-space models.
result URS achieves competitive forecasting accuracy and uncertainty measurement in noisy datasets.

Modeling insider trading with transaction costs and fair pricing.

problem Maximizing profits for an informed trader in a market with transaction costs and fair pricing.
method Single auction model and continuous time analogue, analyzing equilibrium behavior with polynomial and differential equations.
result Equilibrium trading strategy and pricing rules are affected by transaction costs, revealing an information gap.

The paper develops loss functions for pricing models using observational data.

problem Evaluating pricing policies directly from observational data with historical biases.
method Adapting machine learning techniques for corrupted labels to derive unbiased loss functions.
result Identifies minimum variance and robust estimators for contextual pricing.

This paper optimizes revenue and resource balance in network revenue management.

problem Maximizing revenue while ensuring fair resource consumption across different suppliers.
method Introduces a regularized revenue objective and a primal-dual UCB algorithm for continuous prices and balancing.
result Achieves a worst-case regret of O~(N5/2T)\widetilde O(N^{5/2}\sqrt{T}) for revenue maximization and balancing.

Improved learning algorithm for first-price auctions reduces regret significantly.

problem Challenges in learning optimal bidding strategies for first-price auctions.
method Introduced novel ideas to achieve lower regret in sequential learning.
result Achieved log2(T)log^2(T) regret when opponents' bid distribution is known, and T1/3+εT^{1/3+ ε} regret in learning case.