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

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

Author

Listed:
  • Jian Wu
  • William B. Haskell
  • Wenjie Huang
  • Huifu Xu

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.

Suggested Citation

  • Jian Wu & William B. Haskell & Wenjie Huang & Huifu Xu, 2020. "Preference Robust Optimization with Quasi-Concave Choice Functions in Multi-Attribute Decision-Making: Characterization and Computation," Papers 2008.13309, arXiv.org, revised Nov 2024.
  • Handle: RePEc:arx:papers:2008.13309
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2008.13309
    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:2008.13309. 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.