Author
Listed:
- Zal'an Gyenis
- Mikl'os R'edei
- Leszek Wro'nski
Abstract
In a recent paper \cite{Redei-Jing2026} the notion of conditional $p$-inaccessibility of a decision based on utility maximization was defined and examples of conditionally $p$-inaccessible decisions were given. The conditional inaccessibility of a decision based on maximizing utility calculated by a probability measure $p^*$ expresses that the decision cannot be obtained if the expectation values of the utility functions are calculated using the (Jeffrey) conditional probability measure obtained by conditioning $p$ on partial evidence about the probability $p^*$ that determines the decision. The paper \cite{Redei-Jing2026} conjectured that conditionally $p$-inaccessible decisions exist in some probability spaces having arbitrary large finite number of elementary events. In this paper we prove that for any $p$ in any finite probability space there exist an uncountable number of probability measures $p^*$ for each of which there exist an uncountable number of pairs of utility functions that represent conditionally $p$-inaccessible decisions. If $p^*$ is an objective probability determining objectively good decisions and $p$ is the subjective probability determining a rational decision of a decision making Agent, the result says that there is an enormous number of decision situations in which the Agent's subjective probability prohibits the Agent's informed rational decision to be objectively good.
Suggested Citation
Zal'an Gyenis & Mikl'os R'edei & Leszek Wro'nski, 2026.
"Uncountably many conditionally inaccessible decisions exist in every finite probability space,"
Papers
2605.02865, arXiv.org.
Handle:
RePEc:arx:papers:2605.02865
Download full text from publisher
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:2605.02865. 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: 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.