Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 88 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 12 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 110 tok/s Pro
GPT OSS 120B 470 tok/s Pro
Kimi K2 197 tok/s Pro
2000 character limit reached

Preference Robust Optimization with Quasi-Concave Choice Functions in Multi-Attribute Decision-Making: Characterization and Computation (2008.13309v5)

Published 31 Aug 2020 in q-fin.RM and math.OC

Abstract: In behavioural economics, a decision maker's (DM's) preferences are often expressed by a preference functional such as expected utility or a distortion risk measure, which assigns a numerical value to a risky prospect. Preference robust optimization (PRO) is about decision making where the DM's preference functional is ambiguous and the optimal decision is based on the worst-case preference functional from a set of plausible ones constructed from available partial information about the DM's true preferences. In this paper, we propose a choice function (a particular class of preference functionals) based PRO model where the DM's preferences over a prospect space satisfy Von Neumann-Morgenstern's (VNM's) axioms of completeness, monotonicity, and continuity. We concentrate on the class of choice functions which are monotonic, quasi-concave, and multi-attribute. The resulting PRO model is broader than the existing expected utility-based PRO models in that: (a) it captures a broader class of DM's preferences; and (b) it can be effectively applied to multi-attribute decision making problems where the DM's preferences over different attributes are related in a nonlinear manner. We propose a cutting plane-type method for evaluating the worst-case choice function and solve the resulting PRO problem by solving a sequence of convex optimization problems. We examine the behavior and scalability of the proposed model and computational schemes numerically on a multi-portfolio optimization problem and a capital allocation problem.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.