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.
The emph{securities market} is the fundamental theoretical framework in economics and finance for resource allocation under uncertainty. Securities serve both to reallocate risk and to disseminate probabilistic information. emph{Complete} securities markets - which contain one security for every possible state of natur…
In the hypothesis of rare loss events, the general expression of the policy value has been determined as a functional of the "expected frequency / loss severity" function and of the retention function. Exponential disutility has been chosen after mathematical characterization of some of its economical aspects, where fu…
Study on optimal fees in hedge funds with first-loss compensation.
problem Determining the best fee structure for hedge funds with first-loss compensation.
method Solved the manager's non-concave utility maximization problem, calculated Pareto optimal first-loss schemes, and maximized a decision criterion on this set.
result Traditional fees are not Pareto optimal, and the preferred first-loss coverage guarantee varies with investor and market factors.
We consider the problem of optimal risk sharing in a pool of cooperative agents. We analyze the asymptotic behavior of the certainty equivalents and risk premia associated with the Pareto optimal risk sharing contract as the pool expands. We first study this problem under expected utility preferences with an objectivel…
The paper optimizes reinsurance under uncertain dependence among insurers.
problem Designing Pareto-optimal reinsurance contracts in a market with uncertain dependence.
method Robust optimization approach assuming known marginal distributions and unspecified dependence structure.
result Characterization of optimal indemnity schedules under worst-case scenario and derivation of optimal two-parameter layer contracts for independent risks.
Study risk sharing among agents with varying risk preferences.
problem Risk sharing among agents with heterogeneous risk measures.
method Derive explicit solutions for inf-convolution and counter-monotonic inf-convolution under varying risk seeking.
result Explicit solutions for inf-convolution and counter-monotonic inf-convolution can be represented by a generalization of distortion risk measures.
The purpose of this work is to develop and study a distributed strategy for Pareto optimization of an aggregate cost consisting of regularized risks. Each risk is modeled as the expectation of some loss function with unknown probability distribution while the regularizers are assumed deterministic, but are not required…
The paper proposes a new method to learn choice functions using Pareto-embeddings.
problem Learning subset choices from feature vectors.
method Embedding choice alternatives into a higher-dimensional utility space and identifying choice sets with Pareto-optimal points. Minimizing a differentiable loss function.
result The feasibility of learning a Pareto-embedding demonstrated on benchmark datasets.
Recent breakthroughs in Neural Architectural Search (NAS) have achieved state-of-the-art performance in many tasks such as image classification and language understanding. However, most existing works only optimize for model accuracy and largely ignore other important factors imposed by the underlying hardware and devi…
The paper studies risk-sharing allocations for risk-seeking agents using a common distortion risk measure.
problem Characterizing Pareto-optimal risk-sharing allocations for risk-seeking agents.
method Modeling preferences with a common distortion risk measure and analyzing three settings: risk-averse, risk-seeking, and inverse S-shaped distortion.
result Pareto-optimal allocations for risk-seeking agents are counter-monotonic, not comonotonic.
Study on identifying most preferred policy in bandits with vector-valued rewards.
problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.
We develop a single-period model for a large economic agent who trades with market makers at their utility indifference prices. A key role is played by a pair of conjugate saddle functions associated with the description of Pareto optimal allocations in terms of the utility function of a representative market maker.