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.

MoreLess

Year of publication:	2009-05
Authors:	Ciardiello, Francesco ; Gallo, Crescenzio
Institutions:	Dipartimento di Scienze Economiche, Matematiche e Statistiche, Dipartimento di Economia
Subject:	Algorithmic game theory \| coalitional games \| dominance relations \| stable sets \| graph theory

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Quaderni DSEMS.
Type of publication:	Book / Working Paper
Language:	English
Notes:	33 pages
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10008528378