IDEAS home Printed from https://ideas.repec.org/p/arx/papers/1708.07661.html
   My bibliography  Save this paper

Dynamic trading under integer constraints

Author

Listed:
  • Stefan Gerhold
  • Paul Kruhner

Abstract

In this paper we investigate discrete time trading under integer constraints, that is, we assume that the offered goods or shares are traded in integer quantities instead of the usual real quantity assumption. For finite probability spaces and rational asset prices this has little effect on the core of the theory of no-arbitrage pricing. For price processes not restricted to the rational numbers, a novel theory of integer arbitrage free pricing and hedging emerges. We establish an FTAP, involving a set of absolutely continuous martingale measures satisfying an additional property. The set of prices of a contingent claim is no longer an interval, but is either empty or dense in an interval. We also discuss superhedging with integral portfolios.

Suggested Citation

  • Stefan Gerhold & Paul Kruhner, 2017. "Dynamic trading under integer constraints," Papers 1708.07661, arXiv.org.
  • Handle: RePEc:arx:papers:1708.07661
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/1708.07661
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Harrison, J. Michael & Kreps, David M., 1979. "Martingales and arbitrage in multiperiod securities markets," Journal of Economic Theory, Elsevier, vol. 20(3), pages 381-408, June.
    2. P. Bonami & M. A. Lejeune, 2009. "An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints," Operations Research, INFORMS, vol. 57(3), pages 650-670, June.
    3. Pierre Bonami & Miguel A. Lejeune, 2009. "An Exact Solution Approach for Integer Constrained Portfolio Optimization Problems Under Stochastic Constraints," Post-Print hal-00421756, HAL.
    4. Laurence Carassus & Huye^n Pham & Nizar Touzi, 2001. "No Arbitrage in Discrete Time Under Portfolio Constraints," Mathematical Finance, Wiley Blackwell, vol. 11(3), pages 315-329, July.
    5. Föllmer, Hans & Kramkov, D. O., 1997. "Optional decompositions under constraints," SFB 373 Discussion Papers 1997,31, Humboldt University of Berlin, Interdisciplinary Research Project 373: Quantification and Simulation of Economic Processes.
    6. Philipp Baumann & Norbert Trautmann, 2013. "Portfolio-optimization models for small investors," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 77(3), pages 345-356, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Stefan Gerhold & Paul Krühner, 2018. "Dynamic trading under integer constraints," Finance and Stochastics, Springer, vol. 22(4), pages 919-957, October.
    2. Cristiano Arbex Valle, 2024. "Portfolio optimisation: bridging the gap between theory and practice," Papers 2407.00887, arXiv.org, revised Sep 2024.
    3. Dorsaf Cherif & Meriam El Mansour & Emmanuel Lepinette, 2023. "A short note on super-hedging an arbitrary number of European options with integer-valued strategies," Papers 2311.08871, arXiv.org.
    4. Dorsaf Cherif & Meriam El Mansour & Emmanuel Lepinette, 2024. "A Short Note on Super-Hedging an Arbitrary Number of European Options with Integer-Valued Strategies," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1301-1312, June.
    5. Vanita Garg & Kusum Deep, 2019. "Portfolio optimization using Laplacian biogeography based optimization," OPSEARCH, Springer;Operational Research Society of India, vol. 56(4), pages 1117-1141, December.
    6. Alexander Vinel & Pavlo Krokhmal, 2014. "On Valid Inequalities for Mixed Integer p-Order Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 439-456, February.
    7. Zheng, Xiaojin & Sun, Xiaoling & Li, Duan & Cui, Xueting, 2012. "Lagrangian decomposition and mixed-integer quadratic programming reformulations for probabilistically constrained quadratic programs," European Journal of Operational Research, Elsevier, vol. 221(1), pages 38-48.
    8. Claudio Fontana & Wolfgang J. Runggaldier, 2020. "Arbitrage concepts under trading restrictions in discrete-time financial markets," Papers 2006.15563, arXiv.org, revised Sep 2020.
    9. Ran Ji & Miguel A. Lejeune & Srinivas Y. Prasad, 2017. "Properties, formulations, and algorithms for portfolio optimization using Mean-Gini criteria," Annals of Operations Research, Springer, vol. 248(1), pages 305-343, January.
    10. Gili Rosenberg & Poya Haghnegahdar & Phil Goddard & Peter Carr & Kesheng Wu & Marcos L'opez de Prado, 2015. "Solving the Optimal Trading Trajectory Problem Using a Quantum Annealer," Papers 1508.06182, arXiv.org, revised Aug 2016.
    11. Carina Moreira Costa & Dennis Kreber & Martin Schmidt, 2022. "An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 2968-2988, November.
    12. Miguel A. Lejeune & François Margot, 2016. "Solving Chance-Constrained Optimization Problems with Stochastic Quadratic Inequalities," Operations Research, INFORMS, vol. 64(4), pages 939-957, August.
    13. Patrizia Beraldi & Maria Bruni & Antonio Violi, 2012. "Capital rationing problems under uncertainty and risk," Computational Optimization and Applications, Springer, vol. 51(3), pages 1375-1396, April.
    14. Xueting Cui & Xiaoling Sun & Shushang Zhu & Rujun Jiang & Duan Li, 2018. "Portfolio Optimization with Nonparametric Value at Risk: A Block Coordinate Descent Method," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 454-471, August.
    15. Kamesh Korangi & Christophe Mues & Cristi'an Bravo, 2024. "Large-scale Time-Varying Portfolio Optimisation using Graph Attention Networks," Papers 2407.15532, arXiv.org.
    16. Kay Giesecke & Baeho Kim & Jack Kim & Gerry Tsoukalas, 2014. "Optimal Credit Swap Portfolios," Management Science, INFORMS, vol. 60(9), pages 2291-2307, September.
    17. Park, Jungyeon & Alvarenga, Estêvão & Jeon, Jooyoung & Li, Ran & Petropoulos, Fotios & Kim, Hokyun & Ahn, Kwangwon, 2024. "Probabilistic forecast-based portfolio optimization of electricity demand at low aggregation levels," Applied Energy, Elsevier, vol. 353(PB).
    18. Bhatt, Sneha Dhyani & Sinha, Ankur & Jayaswal, Sachin, 2024. "The capacitated r-hub interdiction problem with congestion: Models and solution approaches," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    19. Miten Mistry & Dimitrios Letsios & Gerhard Krennrich & Robert M. Lee & Ruth Misener, 2021. "Mixed-Integer Convex Nonlinear Optimization with Gradient-Boosted Trees Embedded," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 1103-1119, July.
    20. Panos Xidonas & Christis Hassapis & George Mavrotas & Christos Staikouras & Constantin Zopounidis, 2018. "Multiobjective portfolio optimization: bridging mathematical theory with asset management practice," Annals of Operations Research, Springer, vol. 267(1), pages 585-606, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:1708.07661. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.