IDEAS home Printed from https://ideas.repec.org/a/dbk/datame/v3y2024ip.429id1056294dm2024429.html
   My bibliography  Save this article

Optimizing Sequential Decisions: Enhancements to the Brickman Principle with Cumulative Punishment and Probability Adjustments

Author

Listed:
  • R H Samseer
  • J Bamini
  • Khaleel Ibrahim Al- Daoud
  • Asokan Vasudevan
  • Suleiman Ibrahim Shelash Mohammad
  • A. Vasumathi

Abstract

Introduction Determining the optimal stopping point in sequential decision-making scenarios is crucial for maximizing rewards and minimizing costs. Traditional models like the original Brickman Principle often simplify this process by assuming fixed critical values and equal probabilities at each decision stage. These assumptions may not accurately reflect real-world complexities, where costs can be cumulative and probabilities variable. Objective This work seeks to enhance the Brickman Principle by including cumulative punishment elements and non-uniform probability distributions, therefore improving its capacity to accurately represent the intricacies of real-world decision-making. Methods Through a rigorous experimental study, we evaluate the impact of these modifications on optimal stopping rules and expected profits. Results In line with Prospect Theory's emphasis on loss aversion, the results reveal a distinct pattern of risk-averse behavior, with most participants choosing to stop sooner in the sequence to avoid growing fines. Furthermore, we saw substantial variation in both the termination points and anticipated earnings across participants, suggesting that individual disparities in risk tolerance and decision-making approaches are crucial in influencing results

Suggested Citation

Handle: RePEc:dbk:datame:v:3:y:2024:i::p:.429:id:1056294dm2024429
DOI: 10.56294/dm2024.429
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

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:dbk:datame:v:3:y:2024:i::p:.429:id:1056294dm2024429. 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: Javier Gonzalez-Argote (email available below). General contact details of provider: https://dm.ageditor.ar/ .

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.