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

Francesco Ciardiello () and Crescenzio Gallo ()

Quaderni DSEMS from Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia

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.

Keywords: Algorithmic game theory; coalitional games; dominance relations; stable sets; graph theory. (search for similar items in EconPapers)
Pages: 33 pages
Date: 2009-05
New Economics Papers: this item is included in nep-cmp and nep-gth
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.economia.unifg.it/sites/sd01/files/alle ... -11-2016/q082009.pdf (application/pdf)
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://www.economia.unifg.it/sites/sd01/files/allegatiparagrafo/29-11-2016/q082009.pdf [302 Found]--> https://www.economia.unifg.it/sites/sd01/files/allegatiparagrafo/29-11-2016/q082009.pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ufg:qdsems:08-2009

Access Statistics for this paper

More papers in Quaderni DSEMS from Dipartimento di Scienze Economiche, Matematiche e Statistiche, Universita' di Foggia Largo Papa Giovanni Paolo II, 1 -71100- Foggia (I). Contact information at EDIRC.
Bibliographic data for series maintained by Luca Grilli ().