A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure (Q637584): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00182-010-0257-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2091012329 / rank | |||
Normal rank | |||
Revision as of 02:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for computing the nucleolus for a class of disjunctive games with a permission structure |
scientific article |
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
