A Graph-Traversing Algorithm for Computing Some Stable Sets in Effectiveness Coalitional Games
AbstractWe 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia in its series Quaderni DSEMS with number 08-2009.
Length: 33 pages
Date of creation: May 2009
Date of revision:
Algorithmic game theory; coalitional games; dominance relations; stable sets; graph theory.;
This paper has been announced in the following NEP Reports:
- NEP-ALL-2009-09-26 (All new papers)
- NEP-CMP-2009-09-26 (Computational Economics)
- NEP-GTH-2009-09-26 (Game Theory)
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- 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, 08.
- Fan-chin Kung, 2004. "An Algorithm for Stable and Equitable Coalition Structures with Public Goods," Game Theory and Information 0409007, EconWPA, revised 05 May 2005.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Luca Grilli).
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.