JOURNAL ARTICLE

Lipschitz Bernoulli Utility Functions.

  • Published In: Mathematics of Operations Research (INFORMS), 2023, v. 48, n. 2. P. 728 1 of 3

  • Database: Business Source Ultimate 2 of 3

  • Authored By: Ok, Efe A.; Weaver, Nik 3 of 3

Abstract

The article focuses on characterizing Lipschitz Bernoulli utility functions as representations of preference preorders on spaces of lotteries, extending classical expected utility theory. It introduces a novel behavioral axiom—termed the Lipschitz property—on preorders defined over the set Δ₁(X) of Borel probability measures with finite first moment on a separable metric space X, equipped with the Wasserstein 1-metric. The main result establishes that a preorder on Δ₁(X) is affine and satisfies this Lipschitz condition if and only if it admits a representation by a family of Lipschitz Bernoulli utility functions, which may be unbounded. This framework generalizes the von Neumann–Morgenstern expected utility theorem by allowing incomplete preferences and unbounded utilities, and it encompasses virtually all stochastic orders as Lipschitz affine preorders. The paper further explores structural properties, uniqueness, and properness of such multiutilities, relates the Lipschitz condition to a prior definition by Levin, and applies the results to the affine core of preorders and to state-dependent acts in the Anscombe–Aumann framework.

Additional Information

  • Source:Mathematics of Operations Research (INFORMS). 2023/05, Vol. 48, Issue 2, p728
  • Document Type:Article
  • Subject Area:History
  • Publication Date:2023
  • ISSN:0364-765X
  • DOI:10.1287/moor.2022.1270
  • Accession Number:163551363
  • Copyright Statement:Copyright of Mathematics of Operations Research (INFORMS) is the property of INFORMS: Institute for Operations Research & the Management Sciences and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Looking to go deeper into this topic? Look for more articles on EBSCOhost.