IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-05619142.html

On non-standard Isaac’s wall pursuit game using dynamic programming method

Author

Listed:
  • Aicha Ghanem

    (UFAS1 - Université Ferhat-Abbas Sétif 1 [Sétif])

  • Touffik Bouremani

    (UFAS1 - Université Ferhat-Abbas Sétif 1 [Sétif])

  • Djamel Benterki

    (UFAS1 - Université Ferhat-Abbas Sétif 1 [Sétif])

  • Abderrahmane Ziad

    (CREM - Centre de recherche en économie et management - UNICAEN - Université de Caen Normandie - NU - Normandie Université - UR - Université de Rennes - CNRS - Centre National de la Recherche Scientifique)

Abstract

The present paper investigates the perpetual dilemma in the wall pursuit game in a non-standard form, which was proposed as an unsolved problem in Mirică 2004. The fundamental aspect of our approach involves using a novel variant of dynamic programming, which incorporates some refinements of Cauchy's method of characteristics for the stratified Hamilton-Jacobi equations. This, in turn, allows us to aggregate all the admissible trajectories in the form of maximal flows. Consequently, we identify a certain value function that proves useful in checking the optimality of an admissible pair of feedback strategies, through one of the verification theorems for locally Lipschitz functions as sufficient optimality conditions. The results of our study are consolidated by numerical representations that correspond to our theoretical purpose.

Suggested Citation

  • Aicha Ghanem & Touffik Bouremani & Djamel Benterki & Abderrahmane Ziad, 2026. "On non-standard Isaac’s wall pursuit game using dynamic programming method," Post-Print hal-05619142, HAL.
    • Handle: RePEc:hal:journl:hal-05619142
    DOI: 10.1016/j.cam.2026.117701
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;

    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:hal:journl:hal-05619142. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.