IDEAS home Printed from https://ideas.repec.org/a/taf/uiiexx/v56y2024i7p777-791.html
   My bibliography  Save this article

A Bayesian model for multicriteria sorting problems

Author

Listed:
  • Canan Ulu
  • Thomas S. Shively

Abstract

Decision makers are often interested in assigning alternatives to preference classes under multiple criteria instead of choosing the best alternative or ranking all the alternatives. Firms need to categorize suppliers based on performance, credit agencies need to classify customers according to their risks, and graduate programs need to decide who to admit. In this article, we develop an interactive Bayesian algorithm to aid a decision maker (DM) with a multicriteria sorting problem by learning about her preferences and using that knowledge to sort alternatives. We assume the DM has a linear value function and value thresholds for preference classes. Our method specifies an informative prior distribution on the uncertain parameters. At each stage of the process, we compare the expected cost of stopping with the expected cost of continuing to consult the DM. If it is optimal to continue, we select an alternative to present to the DM and, given the DM’s response, we update the prior distribution using Bayes’ Theorem. The goal of the algorithm is to minimize expected total cost. We develop lower bounds on the optimal cost and study the performance of a heuristic policy that presents the DM alternatives with the highest expected cost of misplacement.

Suggested Citation

  • Canan Ulu & Thomas S. Shively, 2024. "A Bayesian model for multicriteria sorting problems," IISE Transactions, Taylor & Francis Journals, vol. 56(7), pages 777-791, July.
  • Handle: RePEc:taf:uiiexx:v:56:y:2024:i:7:p:777-791
    DOI: 10.1080/24725854.2023.2243615
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/24725854.2023.2243615
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/24725854.2023.2243615?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:taf:uiiexx:v:56:y:2024:i:7:p:777-791. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/uiie .

    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.