IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v71y2023i5p1857-1870.html
   My bibliography  Save this article

Every Choice Function Is Pro-Con Rationalizable

Author

Listed:
  • Serhat Dogan

    (Department of Economics, Bilkent University, Ankara 06800, Turkey)

  • Kemal Yildiz

    (Department of Economics, Bilkent University, Ankara 06800, Turkey)

Abstract

We consider an agent who is endowed with two sets of orderings: pro- and con-orderings. For each choice set, if an alternative is the top-ranked by a pro-ordering ( con-ordering ), then this is a pro ( con ) for choosing that alternative. The alternative with more pros than cons is chosen from each choice set. Each ordering may have a weight reflecting its salience. In this case, the probability that an alternative is chosen equals the difference between the total weights of its pros and cons. We show that every nuance of the rich human choice behavior can be captured via this structured model. Our technique requires a generalization of the Ford-Fulkerson theorem, which may be of independent interest. As an application of our results, we show that every choice rule is plurality-rationalizable.

Suggested Citation

  • Serhat Dogan & Kemal Yildiz, 2023. "Every Choice Function Is Pro-Con Rationalizable," Operations Research, INFORMS, vol. 71(5), pages 1857-1870, September.
    • Handle: RePEc:inm:oropre:v:71:y:2023:i:5:p:1857-1870
    DOI: 10.1287/opre.2022.2312
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.2022.2312
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.2022.2312?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
    ---><---

    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:inm:oropre:v:71:y:2023:i:5:p:1857-1870. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.