A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5945570
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure |
scientific article; zbMATH DE number 5945570 |
Statements
A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (English)
0 references
6 September 2011
0 references
nucleolus
0 references
game with permission structure
0 references
peer group game
0 references
information market game
0 references
algorithm
0 references
complexity
0 references
0 references
0.9428131
0 references
0.8964806
0 references
0 references
0.8852637
0 references
0.8797247
0 references
0.87786275
0 references
0.8772564
0 references
