IDEAS home Printed from https://ideas.repec.org/a/wsi/ijtafx/v18y2015i03ns0219024915500193.html
   My bibliography  Save this article

Accelerated Share Repurchase: Pricing And Execution Strategy

Author

Listed:
  • OLIVIER GUÉANT

    (Université Paris-Diderot, UFR de Mathématiques, Laboratoire Jacques-Louis Lions, France)

  • JIANG PU

    (Institut Europlace de Finance, Research Initiative "Exécution optimale et statistiques, de la liquidité haute fréquence", France)

  • GUILLAUME ROYER

    (CMAP, Ecole Polytechnique, Paris, France)

Abstract

In this paper, we consider the optimal execution problem associated to accelerated share repurchase (ASR) contracts. When firms want to repurchase their own shares, they often enter such a contract with a bank. The bank buys the shares for the firm and is paid the average market price over the execution period, the length of the period being decided upon by the bank during the buying process. Mathematically, the problem is new and related to both option pricing (Asian and Bermudan options) and optimal execution. We provide a model, along with associated numerical methods, to determine the optimal stopping time and the optimal buying strategy of the bank.

Suggested Citation

  • Olivier Guéant & Jiang Pu & Guillaume Royer, 2015. "Accelerated Share Repurchase: Pricing And Execution Strategy," International Journal of Theoretical and Applied Finance (IJTAF), World Scientific Publishing Co. Pte. Ltd., vol. 18(03), pages 1-31.
    • Handle: RePEc:wsi:ijtafx:v:18:y:2015:i:03:n:s0219024915500193
    DOI: 10.1142/S0219024915500193
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0219024915500193
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0219024915500193?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Charles-Albert Lehalle & Sophie Laruelle (ed.), 2013. "Market Microstructure in Practice," World Scientific Books, World Scientific Publishing Co. Pte. Ltd., number 8967.
    2. Richard Bellman, 1957. "On a Dynamic Programming Approach to the Caterer Problem--I," Management Science, INFORMS, vol. 3(3), pages 270-278, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Olivier Guéant & Jiang Pu, 2017. "Option Pricing And Hedging With Execution Costs And Market Impact," Mathematical Finance, Wiley Blackwell, vol. 27(3), pages 803-831, July.
    2. Yufan Chen & Lan Wu & Renyuan Xu & Ruixun Zhang, 2024. "Periodic Trading Activities in Financial Markets: Mean-field Liquidation Game with Major-Minor Players," Papers 2408.09505, arXiv.org.
    3. Olivier Guéant & Iuliia Manziuk & Jiang Pu, 2020. "Accelerated share repurchase and other buyback programs: what neural networks can bring," Quantitative Finance, Taylor & Francis Journals, vol. 20(8), pages 1389-1404, August.
    4. Olivier Gu'eant & Iuliia Manziuk & Jiang Pu, 2019. "Accelerated Share Repurchase and other buyback programs: what neural networks can bring," Papers 1907.09753, arXiv.org, revised Nov 2019.
    5. Mohamed Hamdouche & Pierre Henry-Labordere & Huyen Pham, 2023. "Policy gradient learning methods for stochastic control with exit time and applications to share repurchase pricing," Papers 2302.07320, arXiv.org.
    6. Alexis Bismuth & Olivier Gu'eant & Jiang Pu, 2016. "Portfolio choice, portfolio liquidation, and portfolio transition under drift uncertainty," Papers 1611.07843, arXiv.org, revised Mar 2019.
    7. David Evangelista & Yuri Saporito & Yuri Thamsten, 2022. "Price formation in financial markets: a game-theoretic perspective," Papers 2202.11416, arXiv.org.
    8. Bastien Baldacci & Philippe Bergault & Olivier Gu'eant, 2024. "Dispensing with optimal control: a new approach for the pricing and management of share buyback contracts," Papers 2404.13754, arXiv.org, revised Jul 2024.
    9. Olivier Guéant, 2016. "The Financial Mathematics of Market Liquidity: From Optimal Execution to Market Making," Post-Print hal-01393136, HAL.

    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. Eric Sucky, 2006. "Kontraktlogistik—Ein stochastisch dynamischer Planungsansatz zur Logistikdienstleisterauswahl," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(2), pages 131-153, June.
    2. Pierre Bernhard & Marc Deschamps, 2017. "Kalman on dynamics and contro, Linear System Theory, Optimal Control, and Filter," Working Papers 2017-10, CRESE.
    3. Jones, Randall E. & Cacho, Oscar J., 2000. "A Dynamic Optimisation Model of Weed Control," 2000 Conference (44th), January 23-25, 2000, Sydney, Australia 123685, Australian Agricultural and Resource Economics Society.
    4. Voelkel, Michael A. & Sachs, Anna-Lena & Thonemann, Ulrich W., 2020. "An aggregation-based approximate dynamic programming approach for the periodic review model with random yield," European Journal of Operational Research, Elsevier, vol. 281(2), pages 286-298.
    5. Pierre Cardaliaguet & Charles-Albert Lehalle, 2016. "Mean Field Game of Controls and An Application To Trade Crowding," Papers 1610.09904, arXiv.org, revised Sep 2017.
    6. Belzil, Christian, 2007. "The return to schooling in structural dynamic models: a survey," European Economic Review, Elsevier, vol. 51(5), pages 1059-1105, July.
    7. Pam Norton & Ravi Phatarfod, 2008. "Optimal Strategies In One-Day Cricket," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 25(04), pages 495-511.
    8. Mitri Kitti, 2013. "Subgame Perfect Equilibria in Discounted Stochastic Games," Discussion Papers 87, Aboa Centre for Economics.
    9. Rempel, M. & Cai, J., 2021. "A review of approximate dynamic programming applications within military operations research," Operations Research Perspectives, Elsevier, vol. 8(C).
    10. Elena M. Parilina & Alessandro Tampieri, 2018. "Stability and cooperative solution in stochastic games," Theory and Decision, Springer, vol. 84(4), pages 601-625, June.
    11. Aghayi, Nazila & Maleki, Bentolhoda, 2016. "Efficiency measurement of DMUs with undesirable outputs under uncertainty based on the directional distance function: Application on bank industry," Energy, Elsevier, vol. 112(C), pages 376-387.
    12. Baldi, Simone & Michailidis, Iakovos & Ravanis, Christos & Kosmatopoulos, Elias B., 2015. "Model-based and model-free “plug-and-play” building energy efficient control," Applied Energy, Elsevier, vol. 154(C), pages 829-841.
    13. Tan, Madeleine Sui-Lay, 2016. "Policy coordination among the ASEAN-5: A global VAR analysis," Journal of Asian Economics, Elsevier, vol. 44(C), pages 20-40.
    14. Deepmala, 2014. "Existence Theorems for Solvability of a Functional Equation Arising in Dynamic Programming," International Journal of Mathematics and Mathematical Sciences, Hindawi, vol. 2014, pages 1-9, April.
    15. D. W. K. Yeung, 2008. "Dynamically Consistent Solution For A Pollution Management Game In Collaborative Abatement With Uncertain Future Payoffs," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 517-538.
    16. Mahmoudimehr, Javad & Sebghati, Parvin, 2019. "A novel multi-objective Dynamic Programming optimization method: Performance management of a solar thermal power plant as a case study," Energy, Elsevier, vol. 168(C), pages 796-814.
    17. Mahes, Roshan & Mandjes, Michel & Boon, Marko & Taylor, Peter, 2024. "Adaptive scheduling in service systems: A Dynamic programming approach," European Journal of Operational Research, Elsevier, vol. 312(2), pages 605-626.
    18. Korfhage, Thorben & Fischer-Weckemann, Björn, 2024. "Long-run consequences of informal elderly care and implications of public long-term care insurance," Journal of Health Economics, Elsevier, vol. 96(C).
    19. David W. Lu, 2017. "Agent Inspired Trading Using Recurrent Reinforcement Learning and LSTM Neural Networks," Papers 1707.07338, arXiv.org.
    20. Astaraky, Davood & Patrick, Jonathan, 2015. "A simulation based approximate dynamic programming approach to multi-class, multi-resource surgical scheduling," European Journal of Operational Research, Elsevier, vol. 245(1), pages 309-319.

    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:wsi:ijtafx:v:18:y:2015:i:03:n:s0219024915500193. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijtaf/ijtaf.shtml .

    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.