A Graph-Traversing Algorithm for Computing Some Stable Sets in Effectiveness Coalitional Games
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 |
-
Stable sets and max-convex decompositions of TU games
Llerena, Francesc, (2013)
-
Traub, Stefan, (2003)
-
Reducing efficiently the search tree for multiprocessor job-shop scheduling problems
Carballo, Lester, (2013)
- More ...
-
Some Examples and Counterexamples about Continuity on Equilibrium Problems
Ciardiello, Francesco, (2007)
-
Un approccio econofisico alla distribuzione della ricchezza
Grilli, Luca, (2006)
-
Convexity on Nash Equilibria without Linear Structure
Ciardiello, Francesco, (2007)
- More ...