IDEAS home Printed from https://ideas.repec.org/p/ufg/qdsems/08-2009.html
   My bibliography  Save this paper

A Graph-Traversing Algorithm for Computing Some Stable Sets in Effectiveness Coalitional Games

Author

Listed:
  • Francesco Ciardiello
  • Crescenzio Gallo

Abstract

We propose an algorithm for computing "main stable sets" recently introduced by Ciardiello, Di Liddo (2009) on effectiveness form coalitional games modeled through a directed pseudograph. The algorithm is based upon a graph traversing method exploring extended paths minimal in coalitions and we study some its interesting computational aspects for making these stability concepts as useful tools for decision theory.

Suggested Citation

  • Francesco Ciardiello & Crescenzio Gallo, 2009. "A Graph-Traversing Algorithm for Computing Some Stable Sets in Effectiveness Coalitional Games," Quaderni DSEMS 08-2009, Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia.
    • Handle: RePEc:ufg:qdsems:08-2009
    as

    Download full text from publisher

    File URL: http://www.economia.unifg.it/sites/sd01/files/allegatiparagrafo/29-11-2016/q082009.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fan‐Chin Kung, 2006. "An Algorithm for Stable and Equitable Coalition Structures with Public Goods," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 8(3), pages 345-355, August.
    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. Souvik Roy & Soumyarup Sadhukhan, 2019. "A characterization of random min–max domains and its applications," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 68(4), pages 887-906, November.
    2. Fan-Chin Kung, 2015. "Sorting out single-crossing preferences on networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 44(3), pages 663-672, March.
    3. Gopakumar Achuthankutty & Souvik Roy, 2018. "On single-peaked domains and min–max rules," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 51(4), pages 753-772, December.
    4. ,, 2009. "Strategy-proofness and single-crossing," Theoretical Economics, Econometric Society, vol. 4(2), June.
    5. Jiehua Chen & Kirk R. Pruhs & Gerhard J. Woeginger, 2017. "The one-dimensional Euclidean domain: finitely many obstructions are not enough," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(2), pages 409-432, February.
    6. Robert Bredereck & Jiehua Chen & Gerhard Woeginger, 2013. "A characterization of the single-crossing domain," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(4), pages 989-998, October.
    7. Roy, Souvik & Sadhukhan, Soumyarup, 2021. "A unified characterization of the randomized strategy-proof rules," Journal of Economic Theory, Elsevier, vol. 197(C).
    8. Alejandro Saporiti, 2006. "Strategic voting on single-crossing domains," Economics Discussion Paper Series 0617, Economics, The University of Manchester.
    9. Fan-chin Kung, 2013. "Public Good Coalitions and Membership Exclusion," Economics Bulletin, AccessEcon, vol. 33(2), pages 1390-1395.
    10. Achuthankutty, Gopakumar & Roy, Souvik, 2017. "On Top-connected Single-peaked and Partially Single-peaked Domains," MPRA Paper 78102, University Library of Munich, Germany.

    More about this item

    Keywords

    Algorithmic game theory; coalitional games; dominance relations; stable sets; graph theory.;
    All these keywords.

    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:ufg:qdsems:08-2009. 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: Luca Grilli (email available below). General contact details of provider: https://edirc.repec.org/data/emsfoit.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.