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

Expected Utility from a Constructive Viewpoint

Author

Listed:
  • Kislaya Prasad

Abstract

This paper introduces a space of variable lotteries and proves a constructive version of the expected utility theorem. The word ``constructive'' is used here in two senses. First, as in constructive mathematics, the logic underlying proofs is intuitionistic. In a second sense of the word, ``constructive'' is taken to mean ``built up from smaller components.'' Lotteries as well as preferences vary continuously over some topological space. The topology encodes observability or verifiability restrictions -- the open sets of the topology serve as the possible truth values of assertions about preference and reflect constraints on the ability to measure, deduce, or observe. Replacing an open set by a covering of smaller open sets serves as a notion of refinement of information. Within this framework, inability to compare arises as a phenomenon distinct from indifference and this gives rise to the constructive failure of the classical expected utility theorem. A constructive version of the theorem is then proved, and accomplishes several things. First, the representation theorem uses continuous real-valued functions as indicators of preference for variable lotteries and these functions reflect the inability to compare phenomenon. Second, conditions are provided whereby local representations of preference over open sets can be collated to provide a global representation. Third, the proofs are constructive and do not use the law of the excluded middle, which may not hold for variable lotteries. Fourth, a version of the classical theorem is obtained by imposing a condition on the collection of open sets of the topology which has the effect of making the logic classical.

Suggested Citation

  • Kislaya Prasad, 2023. "Expected Utility from a Constructive Viewpoint," Papers 2303.08633, arXiv.org, revised Feb 2024.
  • Handle: RePEc:arx:papers:2303.08633
    as

    Download full text from publisher

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

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:2303.08633. 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.

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