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

295786114 · May 202619922001200920172026
48 results for threshold contracts

This paper presents a novel analysis of two feed-in tariffs (FIT) under market and regulatory uncertainty, namely a sliding premium with cap and floor and a minimum price guarantee. Regulatory uncertainty is modeled with a Poisson process, whereby a jump event may reduce the tariff before the signature of the contract.…

2020-02-05abs ↗pdf ↗

Study on reinsurance decisions using mean-variance criterion with irreversible contracts.

problem Optimizing reinsurance premiums and contracts in a Stackelberg game with irreversible contracts.
method Unified singular control framework applied to both discrete and continuous time reinsurance contracts.
result A single once-for-all reinsurance contract is preferred over multiple contracts, and the signing time is crucial.

We derive a "semi-analytic" solution for a stock loan in which the lender forces liquidation when the loan-to-collateral ratio drops beneath a certain threshold. We use this to study the sensitivity of the contract to model parameters.

2016-02-01abs ↗pdf ↗

Algorithmic insurance tackles financial risks from AI errors, proving CVaR-optimal thresholds reduce tail risk.

problem High-stakes AI errors lead to heterogeneous losses, challenging traditional insurance assumptions.
method Analyzed binary classification performance to tail risk exposure, using CVaR to quantify extreme losses.
result CVaR-optimal thresholds reduce tail risk up to 13-fold compared to accuracy maximization.

Study develops smart contract framework for procurement under demand variability.

problem Operational and economic implications of smart contract adoption under moderate uncertainty.
method Multi-supplier model with endogenized adoption costs, supplier readiness, and inventory penalties; analytical and numerical results.
result Partial adoption strategies support moderate demand variability, while excessive digital investment reduces profitability.

In this paper we discuss the issue of computation of the bilateral credit valuation adjustment (CVA) under rating triggers, and in presence of ratings-linked margin agreements. Specifically, we consider collateralized OTC contracts, that are subject to rating triggers, between two parties -- an investor and a counterpa…

2012-05-30abs ↗pdf ↗

Study optimizes smart contract adoption under high demand variability using Negative Binomial models.

problem Effective supply chain management under high demand variability.
method Combines dynamic Negative Binomial demand modeling with endogenous smart contract adoption optimization.
result The NB model outperforms other benchmarks in forecasting and optimizing smart contract adoption and order quantity.

Study financial contracts pricing in markets with nonproportional costs and constraints.

problem Financial contract pricing in markets with nonproportional transaction costs and portfolio constraints.
method Direct and dual characterization of market-consistent prices with acceptable risk thresholds.
result Extension of the Fundamental Theorem of Asset Pricing to include good deals and scalable good deals.

We analyze the counterparty risk embedded in CDS contracts, in presence of a bilateral margin agreement. First, we investigate the pricing of collateralized counterparty risk and we derive the bilateral Credit Valuation Adjustment (CVA), unilateral Credit Valuation Adjustment (UCVA) and Debt Valuation Adjustment (DVA).…

2011-04-13abs ↗pdf ↗

New algorithms for set union in differential privacy improve efficiency and accuracy.

problem Efficiently discovering items from private user data in natural language processing.
method Developed algorithms that allow users to contribute items in a dependent fashion, guided by a policy with contractive properties.
result New algorithms significantly outperform existing mechanisms in terms of efficiency and accuracy.

Study analyzes smart contract adoption under bounded risk, showing stable adoption but fragile financial outcomes.

problem Understanding smart contract adoption in derivative markets under risk constraints.
method Structural theory linked with simulation and real-world validation.
result Adoption intensity is stable but profitability and service outcomes are sensitive to volatility.

Bitcoin's monetary velocity is constrained by network friction, leading to significant utility contraction during shocks.

problem Bitcoin's monetary velocity is limited by network congestion, causing significant utility loss during economic shocks.
method Empirical analysis using Transaction Cost Index and threshold regression to identify structural breaks and velocity contraction.
result Network friction significantly reduces Bitcoin's monetary velocity, leading to a net utility contraction of -9.39% during shocks.

New RL method learns K-step lookahead Q-functions for fixed-horizon MDPs.

problem Challenges in online reinforcement learning for non-episodic, finite-horizon MDPs.
method Introduces a K-step lookahead Q-function with a time-varying threshold for selecting actions.
result Achieves minimax optimal constant regret for K=1 and O(max((K1),CK1)SATlog(T))\mathcal{O}(\max((K-1),C_{K-1})\sqrt{SAT\log(T)}) regret for K ≥ 2.

Optimal dividend strategy with irreversible reinsurance constraints.

problem Maximizing dividends while adhering to ratcheting and irreversible reinsurance constraints.
method Modeling dividend and reinsurance levels as nondecreasing processes, solving Hamilton-Jacobi-Bellman equation.
result Threshold strategy is optimal for maximizing discounted dividends until ruin.

Differentially quantized gradient methods improve convergence in noisy communication channels.

problem Optimizing distributed learning with limited communication bandwidth and noise.
method Introduces Differential Quantization (DQ) to compensate for quantization errors in gradient descent.
result DQ-GD achieves the same contraction factor as unquantized GD at high bitrates, proving asymptotic optimality.

The paper explores coalescent contractions in contractible spaces, providing criteria and examples.

problem Existence and absence of coalescent contractions in contractible spaces.
method Analysis of contractible finite simplicial complexes and criteria for coalescent contractions.
result Criteria for contractible finite simplicial complexes that ensure no coalescent contractions.

A natural approach to analyze interaction data of form "what-connects-to-what-when" is to create a time-series (or rather a sequence) of graphs through temporal discretization (bandwidth selection) and spatial discretization (vertex contraction). Such discretization together with non-negative factorization techniques c…

2014-06-24abs ↗pdf ↗

In an online contract selection problem there is a seller which offers a set of contracts to sequentially arriving buyers whose types are drawn from an unknown distribution. If there exists a profitable contract for the buyer in the offered set, i.e., a contract with payoff higher than the payoff of not accepting any c…

2013-05-15abs ↗pdf ↗

Optimal execution strategy for merger & acquisition contracts with price impact.

problem Optimal execution and pricing of financial derivatives in M&A deals.
method Indifference utility arguments, considering linear and nonlinear contracts.
result Linear contracts are more expensive and vulnerable to manipulation.

This paper develops a method to select a reference contract for multi-contract quoting to minimize execution risk.

problem Minimizing execution risk in multi-contract quoting sequences.
method Develops a diagnostic framework using order-flow Hawkes forecasts and CLF to select a stable reference contract.
result Event-history and LOB-state signals offer complementary views for reference-contract selection.

We consider a general framework of optimal mechanism design under adverse selection and ambiguity about the type distribution of agents. We prove the existence of optimal mechanisms under minimal assumptions on the contract space and prove that centralized contracting implemented via mechanisms is equivalent to delegat…

2019-10-28abs ↗pdf ↗

New EPS insurance offers partial protection against superannuation losses.

problem Lack of efficient investment insurance for superannuation holders.
method Developed a new financial derivative, equity protection swap (EPS), and derived a fair pricing formula.
result EPS can be an efficient investment insurance tool for superannuation accounts.

Improved security of smart contracts by classifying them into four categories.

problem Detecting and classifying vulnerabilities in smart contracts efficiently.
method Used AWD-LSTM for multi-class classification, addressing class imbalance.
result Achieved a weighted average Fbeta score of 90.0%.

Study on contracting maps and their rigidity under curvature constraints.

problem Rigidity of contracting maps between manifolds with positive curvature.
method Analysis of curvature pinching and contracting conditions involving singular values.
result Established the relation between curvature pinching and contracting conditions.

We study locally compact contractive local groups, that is, locally compact local groups with a contractive pseudo-automorphism. We prove that if such an object is locally connected, then it is locally isomorphic to a Lie group. We also prove a related structure theorem for locally compact contractive local groups whic…

2009-09-24abs ↗pdf ↗

This paper presents some partial answers to the following question. QUESTION. If a normal space X is the union of an increasing sequence of open sets U(1), U(2), U(3) ... such that each U(n) contracts to a point in X, must X be contractible? The main results of the paper are: THEOREM 1. If a normal space X is the union…

2016-06-16abs ↗pdf ↗

Optimal contracts help principals delegate data collection in decentralized ML.

problem Dealing with information asymmetries in decentralized ML.
method Design of optimal and near-optimal contracts addressing uncertainty in model quality and performance.
result Simple linear contracts achieve 1-1/e fraction of optimal utility.

Optimal contracts are found for agents with quadratic effort costs.

problem Finding optimal contracts in principal-agent problems with quadratic effort costs.
method Modeling the problem using Hamilton-Jacobi-Bellman (HJB) equations and proving the existence of classical solutions.
result Existence of optimal contracts for agents with quadratic effort costs is proven.

Fair insurance contracts are designed to handle default risk using cooperative game theory.

problem Designing fair insurance contracts in the presence of default risk.
method Cooperative game theory to specify premiums and participation in benefit.
result Fair benefit participation emerges as a game outcome involving residual risks.

One can define what it means for a compact manifold with corners to be a "contractible manifold with contractible faces." Two combinatorially equivalent, contractible manifolds with contractible faces are diffeomorphic if and only if their 4-dimensional faces are diffeomorphic. It follows that two simple convex polytop…

2013-06-25abs ↗pdf ↗

New mortgage contracts reduce underwater default by adjusting loan balances, but must balance prepayment incentives.

problem Underwater default incentives in mortgages.
method Analyzes automatic balance adjustment and prepayment penalties in mortgage contracts.
result Automatic balance adjustments are preferable to traditional contracts at certain spreads, reducing underwater default.

We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting properly on proper CAT(0) spaces, elements acting hyperbolically on the Bass-Serr…

2011-12-12abs ↗pdf ↗

Optimal linear contracts are possible even with memory in Gaussian settings.

problem Can optimal dynamic contracts be linear when agents control memory processes?
method Developed a methodology for non-Markovian and non-semimartingale settings, showed linear contracts are optimal for one-dimensional models.
result Linear contracts are optimal for one-dimensional models with memory, and for radial effort cost functions in higher dimensions.

Let XX be a contractible 22-complex which is a union of two contractible subcomplexes YY and Z.Z. Is the intersection YZY\cap Z contractible as well? In this note, we prove that the inclusion-induced map π1(YZ)π1(Z)π_{1}(Y\cap Z)\rightarrow π_{1}(Z) is injective if YY is π1π_{1}-injective subcomplex in a locally CAT(0) 2-co…

2018-10-16abs ↗pdf ↗