Dynamic trading under integer constraints
From MaRDI portal
Publication:1788825
DOI10.1007/s00780-018-0369-3zbMath1416.91347arXiv1708.07661OpenAlexW2748774259WikidataQ129351521 ScholiaQ129351521MaRDI QIDQ1788825
Publication date: 8 October 2018
Published in: Finance and Stochastics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.07661
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic finance. An introduction in discrete time.
- The LLL algorithm. Survey and applications
- Martingales and arbitrage in multiperiod securities markets
- Diophantine approximations and diophantine equations
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Optional decompositions under constraints
- Computational study of a family of mixed-integer quadratic programming problems
- Portfolio-optimization models for small investors
- The mathematics of arbitrage
- No Arbitrage in Discrete Time Under Portfolio Constraints
- Algorithms for the Shortest and Closest Lattice Vector Problems
- COMPUTATIONAL COMPLEXITY OF ARBITRAGE IN FRICTIONAL SECURITY MARKET
- An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
- Equivalent martingale measures and no-arbitrage in stochastic securities market models
- OPTIMAL SUPERHEDGING UNDER NON-CONVEX CONSTRAINTS — A BSDE APPROACH
- Closest point search in lattices
- Computing the Continuous Discretely
This page was built for publication: Dynamic trading under integer constraints