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

60120179239 · May 202619922001200920172026
48 results for risk shadow price

Paper optimizes trading strategies by creating shadow prices for markets with transaction costs.

problem Optimizing trading strategies in markets with transaction costs.
method Developed shadow prices to simplify optimization into a frictionless market, considering second-order transaction costs.
result Alternative strategies outperform shadow prices for risk aversion different from one.

Unified framework for ESG-inclusive portfolio optimization and pricing.

problem Incorporating ESG ratings into dynamic asset pricing theory.
method Introducing ESG-valued return as a linear transformation of financial and ESG scores, preserving traditional risk aversion with an ESG affinity parameter.
result Developed a more complex portfolio optimization problem in a space governed by reward, risk, and ESG score.

In a financial market with a continuous price process and proportional transaction costs we investigate the problem of utility maximization of terminal wealth. We give sufficient conditions for the existence of a shadow price process, i.e.~a least favorable frictionless market leading to the same optimal strategy and u…

2014-08-26abs ↗pdf ↗

Myopic optimization outperforms reinforcement learning in portfolio management, leading to lower returns and higher risks.

problem Reinforcement learning strategies in portfolio management yield lower or negative returns and higher risks compared to myopic optimization.
method Modeling execution/liquidation frictions with mark-to-market accounting, using Malliavin calculus to derive policy gradients and risk shadow price, and quantifying phantom profit.
result Myopic optimization outperforms reinforcement learning in portfolio management, leading to better returns and lower risks.

For portfolio choice problems with proportional transaction costs, we discuss whether or not there exists a "shadow price", i.e., a least favorable frictionless market extension leading to the same optimal strategy and utility. By means of an explicit counter-example, we show that shadow prices may fail to exist even i…

2012-05-21abs ↗pdf ↗

A shadow price is a process lying within the bid/ask prices of a market with proportional transaction costs, such that maximizing expected utility from consumption in the frictionless market with this price process leads to the same maximal utility as in the original market with transaction costs. For finite probabilit…

2009-11-25abs ↗pdf ↗

For portfolio optimisation under proportional transaction costs, we provide a duality theory for general cadlag price processes. In this setting, we prove the existence of a dual optimiser as well as a shadow price process in a generalised sense. This shadow price is defined via a "sandwiched" process consisting of a p…

2014-08-26abs ↗pdf ↗

In a market with one safe and one risky asset, an investor with a long horizon, constant investment opportunities, and constant relative risk aversion trades with small proportional transaction costs. We derive explicit formulas for the optimal investment policy, its implied welfare, liquidity premium, and trading volu…

2011-08-04abs ↗pdf ↗

We consider the problem of maximizing expected power utility from consumption over an infinite horizon in the Black-Scholes model with proportional transaction costs, as studied in Shreve and Soner [Ann. Appl. Probab. 4 (1994) 609-692]. Similar to Kallsen and Muhle-Karbe [Ann. Appl. Probab. 20 (2010) 1341-1358], we der…

2011-12-19abs ↗pdf ↗

In frictionless markets, utility maximization problems are typically solved either by stochastic control or by martingale methods. Beginning with the seminal paper of Davis and Norman [Math. Oper. Res. 15 (1990) 676--713], stochastic control theory has also been used to solve various problems of this type in the presen…

2010-10-21abs ↗pdf ↗

For utility maximization problems under proportional transaction costs, it has been observed that the original market with transaction costs can sometimes be replaced by a frictionless "shadow market" that yields the same optimal strategy and utility. However, the question of whether or not this indeed holds in general…

2011-11-28abs ↗pdf ↗

An asset network systemic risk (ANWSER) model is presented to investigate the impact of how shadow banks are intermingled in a financial system on the severity of financial contagion. Particularly, the focus of this study is the impact of the following three representative topologies of an interbank loan network betwee…

2014-09-30abs ↗pdf ↗

Develops a method to estimate the shadow riskless rate from empirical data.

problem No risky asset in market, need for a shadow riskless rate.
method PCA, SVD, regularization to estimate SRR from correlated geometric Brownian motion.
result Estimates the shadow riskless rate from empirical datasets.

Study models risks for low-carbon economy in Balkan countries, focusing on shadow economy and populism.

problem Risks and uncertainties in establishing a low-carbon economy in Balkan countries with transition economies.
method Transdisciplinary approach combining economic policy, public opinion, and climate change models.
result Identifies shadow economy and populism as key risk factors for low-carbon economy implementation.

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.

Extends martingale transport for robust finance problems.

problem Addressing specific robust finance problems not covered by standard martingale transport.
method Introduces an additional parameter to the weak martingale optimal transport problem and proves stability.
result Stability of the extended problem with respect to risk-neutral marginal distributions.

This paper examines if CTE risk measure aligns with profit-maximizing risk capital allocations.

problem Whether CTE risk measure aligns with profit-maximizing risk capital allocations.
method Exhaustive probabilistic model settings analysis.
result CTE risk measure may align with profit-maximizing risk capital allocations under certain conditions.

Optimizes cryptocurrency exchanges' risk management by reducing positions based on leverage.

problem Managing risk in cryptocurrency futures exchanges during large price moves.
method Formulates ADL as an optimization problem to minimize risk of loss, using a water-filling rule to equalize leverage.
result The optimal ADL policy minimizes maximum leverage among participants, providing a transparent and implementable benchmark.

New method assesses individual training points' privacy risk without retraining.

problem Privacy vulnerability of individual training points in membership inference attacks.
method Derives a closed-form decomposition of individual black-box MIA vulnerability, extending to deep networks.
result Proposes a surrogate score operating on last-layer representations that requires only a single trained model.

In a continuous-time model with multiple assets described by càdlàg processes, this paper characterizes superhedging prices, absence of arbitrage, and utility maximizing strategies, under general frictions that make execution prices arbitrarily unfavorable for high trading intensity. Such frictions induce a duality bet…

2015-06-19abs ↗pdf ↗

To use neural networks in safety-critical settings it is paramount to provide assurances on their runtime operation. Recent work on ReLU networks has sought to verify whether inputs belonging to a bounded box can ever yield some undesirable output. Input-splitting procedures, a particular type of verification mechanism…

2019-02-19abs ↗pdf ↗

A new, low-cost method speeds up membership inference attacks on large language models.

problem Membership inference attacks on large language models.
method An ensemble of small quantile regression models to determine model training set membership.
result Comparable or improved accuracy with significantly reduced computational cost.

A shadow diagram is a knot diagram with under-over information omitted; a shadow movie is a sequence of shadow diagrams related by shadow Reidemeister moves. We show that not every shadow movie arises as the shadow of a Reidemeister movie, meaning a sequence of classical knot diagrams related by classical Reidemeister …

2011-06-17abs ↗pdf ↗

Study stability of contingent claim solutions under probabilistic perturbations.

problem Stability of solutions to discrete-time contingent-claim problems under uncertainty.
method Use Rockafellian perturbations to analyze stability of solutions.
result Establishes convergence of dual problems and shadow prices.

The average shadowing property is considered for set-valued dynamical systems, generated by parameterized IFS, which are uniformly contracting, or conjugacy, or products of such ones. We also prove that if a continuous surjective IFS F on a compact metric space X has the aver- age shadowing property, then every point x…

2015-05-25abs ↗pdf ↗

We construct elements of the third quandle homology groups of knot quandles, which are called the shadow fundamental classes. They play the same roles for the shadow quandle cocycle invariants of knots as the fundamental classes of knot quandles does for the quandle cocycle invariants. As an application of the shadow f…

2009-06-03abs ↗pdf ↗

Study on inflection points of plane curve shadows with fixed embedded shapes.

problem Minimum number of inflection points in plane curves with fixed embedded shadows.
method Finite coorientation problem on building polygons, dynamic programming, universal lower bound, tree-necklace shadows.
result Exact formula for minimum number of normalized inflections for tree-like shadows.

We introduce an associative algebra Z[X,S] associated to a birack shadow and define enhancements of the birack counting invariant for classical knots and links via representations of Z[X,S] known as shadow modules. We provide examples which demonstrate that the shadow module enhanced invariants are not determined by th…

2011-06-01abs ↗pdf ↗