Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
From MaRDI portal
Publication:829338
Abstract: For incomplete preference relations that are represented by multiple priors and/or multiple -- possibly multivariate -- utility functions, we define a certainty equivalent as well as the utility buy and sell prices and indifference price bounds as set-valued functions of the claim. Furthermore, we motivate and introduce the notion of a weak and a strong certainty equivalent. We will show that our definitions contain as special cases some definitions found in the literature so far on complete or special incomplete preferences. We prove monotonicity and convexity properties of utility buy and sell prices that hold in total analogy to the properties of the scalar indifference prices for complete preferences. We show how the (weak and strong) set-valued certainty equivalent as well as the indifference price bounds can be computed or approximated by solving convex vector optimization problems. Numerical examples and their economic interpretations are given for the univariate as well as for the multivariate case.
Recommendations
- Multi-utility representations of incomplete preferences induced by set-valued risk measures
- On the existence of certainty equivalents of various relevant types
- Convergence of utility indifference prices to the superreplication price in a multiple‐priors framework
- Uncertain equilibria and incomplete preferences
- Remarks on the consumer problem under incomplete preferences
Cites work
- scientific article; zbMATH DE number 5529013 (Why is no real title available?)
- scientific article; zbMATH DE number 2063780 (Why is no real title available?)
- A Benson type algorithm for nonconvex multiobjective programming problems
- A multidimensional exponential utility indifference pricing model with applications to counterparty risk
- A set optimization approach to utility maximization under transaction costs
- Adaptive Scalarization Methods in Multiobjective Optimization
- An algorithm for calculating the set of superhedging portfolios in markets with transaction costs
- An approximation algorithm for convex multi-objective programming problems
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximation methods in multiobjective programming
- Complementary symmetry in cumulative prospect theory with random reference
- Empirical evaluation of four models of buying and selling prices of gambles
- Expected utility theory without the completeness axiom.
- Incomplete preferences under uncertainty: indecisiveness in beliefs versus tastes
- Knightian decision theory. I.
- Minimal element theorems and Ekeland's principle with set relations
- Multivariate utility maximization with proportional transaction costs
- Multivariate utility maximization with proportional transaction costs and random endowment
- Non-arbitrage criteria for financial markets with efficient friction
- On complementary symmetry under cumulative prospect theory
- On cone convexity of set-valued maps
- Primal and dual approximation algorithms for convex vector optimization problems
- Recursiveness of indifference prices and translation-invariant preferences
- Scalarizing vector optimization problems
- Subjective expected utility with incomplete preferences
- The shape of incomplete preferences
- Theory of games and economic behavior.
- Utility Theory without the Completeness Axiom
- Utility representation of an incomplete preference relation
Cited in
(10)- Algorithms to Solve Unbounded Convex Vector Optimization Problems
- Convergence analysis of a norm minimization-based convex vector optimization algorithm
- Multivariate decisions with unknown price vector
- A norm minimization-based convex vector optimization algorithm
- Multi-utility representations of incomplete preferences induced by set-valued risk measures
- Well-posedness and existence for the weak multicriteria Nash equilibrium of multicriteria games
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Outer approximation algorithms for convex vector optimization problems
- Computing the recession cone of a convex upper image via convex projection
- On dynamic programming equations for utility indifference pricing under delta constraints
This page was built for publication: Certainty equivalent and utility indifference pricing for incomplete preferences via convex vector optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829338)
