A Graph-Traversing Algorithm for Computing Some Stable Sets in Effectiveness Coalitional Games
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.
|Date of creation:||May 2009|
|Date of revision:|
|Contact details of provider:|| Postal: Largo Papa Giovanni Paolo II, 1 -71100- Foggia (I)|
Web page: http://www.dsems.unifg.it
More information through EDIRC
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, 2004.
"An Algorithm for Stable and Equitable Coalition Structures with Public Goods,"
Game Theory and Information
0409007, EconWPA, revised 05 May 2005.
- 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.
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Luca Grilli)
If references are entirely missing, you can add them using this form.