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.

169,291 papers · 148 categories

Trend · papers per month

4.0%8.0%12.0%15.9% · Jul 200219922001200920182026
48 results for imperfect market

Model financial markets using open quantum systems to understand market imperfections.

problem Understanding market imperfections through imperfect trading mechanisms.
method Using open quantum systems to represent financial markets, characterizing orbits, and analyzing reduced density matrices.
result Non-classical modes of time evolution can incorporate factors like illiquid trades and imperfect trading mechanisms.

Study on liquidity and market efficiency in auction games with imperfect information.

problem Generating liquidity in illiquid auction markets with imperfect information.
method Characterized Nash equilibria in a two-player game with imperfect information, linking market spreads to signal strength.
result Without incentives, the market is inefficient and does not lead to trades. Quadratic fees indexed on half spread can generate liquidity.

We study pricing and superhedging strategies for game options in an imperfect market with default. We extend the results obtained by Kifer in \cite{Kifer} in the case of a perfect market model to the case of an imperfect market with default, when the imperfections are taken into account via the nonlinearity of the weal…

2015-11-29abs ↗pdf ↗

We present a novel methodology for predicting future outcomes that uses small numbers of individuals participating in an imperfect information market. By determining their risk attitudes and performing a nonlinear aggregation of their predictions, we are able to assess the probability of the future outcome of an uncert…

2001-08-02abs ↗pdf ↗

Study pricing and hedging for American options in a market with default risk.

problem Pricing and hedging American options in a market with default risk.
method Defines seller's and buyer's superhedging prices using optimal stopping problems and nonlinear expectations.
result Seller's and buyer's superhedging prices coincide and are characterized by nonlinear reflected BSDEs.

We derive asset pricing formula for markets with incomplete information and subjective views.

problem Asset pricing in markets with informational imperfections and subjective investor beliefs.
method Closed-form market equilibrium formula based on Merton's model, non-linear system of equations, conditional posterior distribution.
result Derivation of market reference model for excess returns under random shadow-costs.

I study the limit of a large random economy, where a set of consumers invests in financial instruments engineered by banks, in order to optimize their future consumption. This exercise shows that, even in the ideal case of perfect competition, where full information is available to all market participants, the equilibr…

2009-06-08abs ↗pdf ↗

The paper analyzes insurance pricing and capital allocation in imperfect markets.

problem Analyzing insurance pricing and capital allocation in imperfect markets.
method Non-additive distortion pricing functional and principle of equal priority of payments in default.
result Derives the natural allocation of premium and margin with properties that merit the name.

The paper develops a new discount rate for derivatives using imperfect securities as collateral.

problem Inconsistent and non-observable collateral rates in derivatives markets.
method Synthesizes effects of imperfect collateral into a new discount rate, employs break-even repo formulae, and uses linear programming for optimization.
result Liquidity value adjustment (LVA) can be significant for long-term derivatives portfolios.

Paper proposes a novel policy distillation method for better order execution in noisy markets.

problem Effective order execution in noisy and imperfect market conditions.
method Policy distillation method to guide reinforcement learning towards optimal trading strategies.
result Significant improvements over various baselines in order execution.

Develops methods to improve demand counterfactuals from imperfect proxies.

problem Imperfect proxies in demand models lead to biased counterfactuals and invalid inference.
method Practical toolkit for market-level and individual data, requiring minimal computation.
result Improves substitution prediction and counterfactual performance.

Heuristic pricing strategy compensates for imperfect market anticipation in dynamic pricing competition.

problem Challenges in optimizing pricing strategies due to competition and limited demand information.
method Stochastic dynamic pricing models under oligopoly competition with frequent price adjustments.
result Price adjustment frequencies have a larger impact on expected profits than price anticipations.

Model shows disclosure reduces trading costs in oligopolistic markets.

problem Reducing trading costs in oligopolistic markets with imperfect competition.
method Developed a multi-period Kyle-type model with mandatory disclosure and imperfect competition, proving existence and uniqueness of a linear equilibrium.
result Disclosure lowers trading costs by reducing price impact, and its marginal benefit is larger when competition is weak.

High-frequency traders manage inventories to exploit price information, leading to mean-reverting inventories and excess trading.

problem Managing inventories for high-frequency traders in imperfect competition.
method Analyzes Nash equilibria for inventory-averse HFTs using nonlinear equations and asymptotic analysis.
result Optimal inventories become mean-reverting and vanish in the continuous-time limit, while HFTs' profits converge to risk-neutral counterparts.

We propose a new non parametric technique to estimate the CALL function based on the superhedging principle. Our approach does not require absence of arbitrage and easily accommodates bid/ask spreads and other market imperfections. We prove some optimal statistical properties of our estimates. As an application we firs…

2015-02-13abs ↗pdf ↗

We study the problem of optimal execution of a trading order under Volume Weighted Average Price (VWAP) benchmark, from the point of view of a risk-averse broker. The problem consists in minimizing mean-variance of the slippage, with quadratic transaction costs. We devise multiple ways to solve it, in particular we stu…

2015-09-28abs ↗pdf ↗

The paper explores how regularization can lead to convergence in imperfect information games.

problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.

The paper tackles learning from imperfect human feedback, especially in dueling bandit problems.

problem Learning from human feedback that can be irrational or imperfect.
method Developed a Robustified Stochastic Mirror Descent for Imperfect Dueling (RoSMID) algorithm.
result Achieved nearly optimal regret for dueling bandit problems under imperfect human feedback.

Model learns tensor representations from imperfect multimodal data.

problem Learning from imperfect multimodal data with noise or missing entries.
method Tensor rank minimization to regularize rank of tensor representations.
result Model effectively learns tensor representations from imperfect data.

The paper proposes a new framework to generate synthetic data with human-like imperfections to prevent model collapse.

problem Model collapse due to statistical optimization of synthetic data.
method Introduces Prompt-driven Cognitive Computing Framework (PMCSF) with Cognitive State Decoder (CSD) and Cognitive Text Encoder (CTE).
result The framework generates text with cognitive imperfections, reducing maximum drawdown and delivering defensive alpha.

Investigates a Kyle model with imperfect information and risk aversion.

problem Tackles a Kyle model with imperfect information and risk-averse informed traders.
method Solves an optimal transport problem and a filtering problem under specific measures.
result Constructs an equilibrium for the Gaussian Kyle model with imperfect information and risk aversion.

It is believed by the majority today that the efficient market hypothesis is imperfect because of market irrationality. Using the physical concepts and mathematical structures of quantum mechanics, we construct an econophysics framework for the stock market, based on which we analogously map massive numbers of single s…

2014-05-13abs ↗pdf ↗

We study the optimal trading policies for a wind energy producer who aims to sell the future production in the open forward, spot, intraday and adjustment markets, and who has access to imperfect dynamically updated forecasts of the future production. We construct a stochastic model for the forecast evolution and deter…

2016-09-07abs ↗pdf ↗

Policy gradient method proves convergence in imperfect-information games.

problem Policy gradient methods in imperfect-information games (EFGs).
method Policy gradient approach with best-iterate convergence.
result Policy gradient leads to provable best-iterate convergence in self-play EFGs.

JPS improves joint policies for multi-agent collaboration in imperfect information games.

problem Learning good joint policies for multi-agent collaboration with imperfect information.
method Decomposes global changes to localized policy changes, iteratively improving joint policies without re-evaluating the entire game.
result JPS improves solutions provided by unilateral approaches and outperforms algorithms designed for collaborative policy learning.

Triangle lasso improves clustering and optimization in noisy graphs.

problem Noise and missing data in graph datasets lead to sub-optimal clustering results.
method Triangle lasso uses neighbors' similarity to find similar instances, avoiding direct feature comparison.
result Triangle lasso yields better results than state-of-the-art methods in practical scenarios.

The paper models rating transitions and calibrates them to market data for XVA calculations.

problem Calibrating rating models to both historical and market data for accurate XVA calculations.
method Modeling rating transitions as a Markov chain, calibrating to historical and market data, proposing a novel calibration procedure.
result Improved XVA scheme through better calibration of rating models.

Deep neural network learns to play Big 2, a 4-player imperfect information game, outperforming amateurs.

problem Training a neural network to play a complex, imperfect information game with multiple players.
method Self-play reinforcement learning using Proximal Policy Optimization.
result Deep neural network trained via self-play reaches performance level surpassing amateur players.

Algorithm learns NE in imperfect information games with imperfect feedback.

problem Learning Nash equilibrium in imperfect information games with bandit feedback.
method IXOMD algorithm for model-free learning with 1/T1/\sqrt{T} convergence rate.
result IXOMD achieves 1/T1/\sqrt{T} convergence rate to NE.

Market trade-routes can support infectious-disease transmission, impacting biological populations and even disrupting causal trade. Epidemiological models increasingly account for reductions in infectious contact, such as risk-aversion behaviour in response to pathogen outbreaks. However, market dynamics clearly differ…

2013-10-23abs ↗pdf ↗

Bayesian machine learning algorithm for causal effects with imperfect compliance.

problem Heterogeneous causal effects in imperfect compliance scenarios.
method Bayesian Causal Forest with Instrumental Variable (BCF-IV) methodology.
result BCF-IV outperforms other techniques in discovering and estimating heterogeneous causal effects.

The study examines how verifier imperfections impact test-time scaling techniques.

problem Understanding how verifier imperfections affect test-time scaling methods.
method Proves the instance-level accuracy of Best-of-N and Rejection Sampling methods using the geometry of the verifier's ROC curve.
result RS outperforms BoN for fixed compute, but both converge to the same accuracy in the infinite-compute limit.