IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-04114152.html
   My bibliography  Save this paper

A Core-Partition Ranking Solution to Coalitional Ranking Problems

Author

Listed:
  • Sylvain Béal

    (UFC - Université de Franche-Comté - UBFC - Université Bourgogne Franche-Comté [COMUE])

  • Sylvain Ferrières

    (UJM - Université Jean Monnet - Saint-Étienne)

  • Philippe Solal

    (UJM - Université Jean Monnet - Saint-Étienne)

Abstract

A coalitional ranking problem is described by a weak order on the set of nonempty coalitions of a given agent set. A social ranking is a weak order on the set of agents. We consider social rankings that are consistent with stable/core partitions. A partition is stable if there is no coalition better ranked in the coalitional ranking than the rank of the cell of each of its members in the partition. The core-partition social ranking solution assigns to each coalitional ranking problem the set of social rankings such that there is a core-partition satisfying the following condition: a first agent gets a higher rank than a second agent if and only if the cell to which the first agent belongs is better ranked in the coalitional ranking than the cell to which the second agent belongs in the partition. We provide an axiomatic characterization of the core-partition social ranking and an algorithm to compute the associated social rankings.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2023. "A Core-Partition Ranking Solution to Coalitional Ranking Problems," Post-Print hal-04114152, HAL.
    • Handle: RePEc:hal:journl:hal-04114152
    DOI: 10.1007/s10726-023-09832-2
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Steven J. Brams & William V. Gehrlein & Fred S. Roberts (ed.), 2009. "The Mathematics of Preference, Choice and Order," Studies in Choice and Welfare, Springer, number 978-3-540-79128-7, June.
    2. Giulia Bernardi & Roberto Lucchetti & Stefano Moretti, 2019. "Ranking objects from a preference relation over their subsets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 52(4), pages 589-606, April.
    3. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2022. "Lexicographic solutions for coalitional rankings based on individual and collective performances," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    4. Encarnación Algaba & Stefano Moretti & Eric Rémila & Philippe Solal, 2021. "Lexicographic solutions for coalitional rankings," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 57(4), pages 817-849, November.
    5. Encarnación Algaba & Stefano Moretti & Eric Rémila & Philippe Solal, 2021. "Lexicographic solutions for coalitional rankings," Post-Print hal-03422945, HAL.
    6. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 66(1), pages 23-38.
    7. William Thomson, 2011. "Consistency and its converse: an introduction," Review of Economic Design, Springer;Society for Economic Design, vol. 15(4), pages 257-291, December.
    8. Iehle, Vincent, 2007. "The core-partition of a hedonic game," Mathematical Social Sciences, Elsevier, vol. 54(2), pages 176-185, September.
    9. Steven J. Brams & M. Remzi Sanver, 2009. "Voting Systems that Combine Approval and Preference," Studies in Choice and Welfare, in: Steven J. Brams & William V. Gehrlein & Fred S. Roberts (ed.), The Mathematics of Preference, Choice and Order, pages 215-237, Springer.
    10. Mehmet Karakaya & Bettina Klaus, 2017. "Hedonic coalition formation games with variable populations: core characterizations and (im)possibilities," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 435-455, May.
    11. William Thomson, 2001. "On the axiomatic method and its recent applications to game theory and resource allocation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(2), pages 327-386.
    12. , & ,, 2009. "Coalition formation under power relations," Theoretical Economics, Econometric Society, vol. 4(1), March.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sylvain Béal & Sylvain Ferrières & Philippe Solal, 2021. "A Core-partition solution for coalitional rankings with a variable population domain," Working Papers 2021-06, CRESE.
    2. Felix Fritz & Stefano Moretti & Jochen Staudacher, 2023. "Social Ranking Problems at the Interplay between Social Choice Theory and Coalitional Games," Mathematics, MDPI, vol. 11(24), pages 1-22, December.
    3. Gonzalez, Stéphane & Lardon, Aymeric, 2021. "Axiomatic foundations of the core for games in effectiveness form," Mathematical Social Sciences, Elsevier, vol. 114(C), pages 28-38.
    4. Béal, Sylvain & Rémila, Eric & Solal, Philippe, 2022. "Lexicographic solutions for coalitional rankings based on individual and collective performances," Journal of Mathematical Economics, Elsevier, vol. 102(C).
    5. Stéphane Gonzalez & Aymeric Lardon, 2018. "Axiomatic Foundations of a Unifying Core," Working Papers 1817, Groupe d'Analyse et de Théorie Economique Lyon St-Étienne (GATE Lyon St-Étienne), Université de Lyon.
    6. Federica Ceron & Stéphane Gonzalez, 2019. "A characterization of Approval Voting without the approval balloting assumption," Working Papers halshs-02440615, HAL.
    7. Steven Brams & Richard Potthoff, 2015. "The paradox of grading systems," Public Choice, Springer, vol. 165(3), pages 193-210, December.
    8. Richard Potthoff, 2011. "Condorcet Polling," Public Choice, Springer, vol. 148(1), pages 67-86, July.
    9. Can, Burak & Pourpouneh, Mohsen & Storcken, Ton, 2023. "Distance on matchings: an axiomatic approach," Theoretical Economics, Econometric Society, vol. 18(2), May.
    10. Güth, Werner & Vittoria Levati, M. & Montinari, Natalia, 2014. "Ranking alternatives by a fair bidding rule: A theoretical and experimental analysis," European Journal of Political Economy, Elsevier, vol. 34(C), pages 206-221.
    11. Alessandro Albano & José Luis García-Lapresta & Antonella Plaia & Mariangela Sciandra, 2023. "A family of distances for preference–approvals," Annals of Operations Research, Springer, vol. 323(1), pages 1-29, April.
    12. Trockel, Walter, 2017. "Can and should the Nash Program be looked at as a part of mechanism theory," Center for Mathematical Economics Working Papers 322, Center for Mathematical Economics, Bielefeld University.
    13. Bora Erdamar & José Luis Garcia-Lapresta & David Pérez-Roman & Remzi Sanver, 2012. "Measuring consensus in a preference-approval context," Working Papers hal-00681297, HAL.
    14. Walter Trockel, 2002. "Integrating the Nash program into mechanism theory," Review of Economic Design, Springer;Society for Economic Design, vol. 7(1), pages 27-43.
    15. Osório, António, 2017. "Self-interest and equity concerns: A behavioural allocation rule for operational problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 205-213.
    16. Karol Flores-Szwagrzak & Rafael Treibich, 2020. "Teamwork and Individual Productivity," Management Science, INFORMS, vol. 66(6), pages 2523-2544, June.
    17. Barberà, Salvador & Beviá, Carmen & Ponsatí, Clara, 2015. "Meritocracy, egalitarianism and the stability of majoritarian organizations," Games and Economic Behavior, Elsevier, vol. 91(C), pages 237-257.
    18. Stéphane Gonzalez & Aymeric Lardon, 2018. "Axiomatic Foundations of a Unifying Concept of the Core of Games in Effectiveness Form," GREDEG Working Papers 2018-15, Groupe de REcherche en Droit, Economie, Gestion (GREDEG CNRS), Université Côte d'Azur, France.
    19. Maksim Gladyshev, 2019. "Vulnerability Of Voting Paradoxes As A Criteria For Voting Procedure Selection," HSE Working papers WP BRP 70/PS/2019, National Research University Higher School of Economics.
    20. Yajing Chen, 2017. "New axioms for deferred acceptance," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 393-408, February.

    More about this item

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games

    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:hal:journl:hal-04114152. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.