IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v130y2024icp24-37.html
   My bibliography  Save this article

A solution for abstract decision problems based on maximum flow value

Author

Listed:
  • Gori, Michele

Abstract

An abstract decision problem is an ordered pair where the first component is a nonempty and finite set of alternatives from which a society has to make a choice and the second component is an irreflexive relation on that set representing a dominance relation. A crucial problem is to find a reasonable solution that allows to select, for any given abstract decision problem, some of the alternatives. A variety of solutions have been proposed over the years. In this paper we propose a new solution, called maximum flow value set, that naturally stems from the work by Bubboloni and Gori (The flow network method, Social Choice and Welfare 51, pp. 621–656, 2018) and that is based on the concept of maximum flow value in a digraph. We analyze its properties and its relation with other solutions such as the core, the admissible set, the uncovered set, the Copeland set and the generalized stable set. We also show that the maximum flow value set allows to define a new Condorcet social choice correspondence strictly related to the Copeland social choice correspondence and fulfilling lots of desirable properties.

Suggested Citation

  • Gori, Michele, 2024. "A solution for abstract decision problems based on maximum flow value," Mathematical Social Sciences, Elsevier, vol. 130(C), pages 24-37.
    • Handle: RePEc:eee:matsoc:v:130:y:2024:i:c:p:24-37
    DOI: 10.1016/j.mathsocsci.2024.05.003
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165489624000519
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.mathsocsci.2024.05.003?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.

    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:eee:matsoc:v:130:y:2024:i:c:p:24-37. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.