On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q2670922)
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 7535991
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of nucleolus computation for bipartite \(b\)-matching games |
scientific article; zbMATH DE number 7535991 |
Statements
On the complexity of nucleolus computation for bipartite \(b\)-matching games (English)
0 references
1 June 2022
0 references
nucleolus
0 references
\(b\)-matching
0 references
cooperative game theory
0 references
computational complexity
0 references
0 references
0.8453028798103333
0 references
0.8440974354743958
0 references
0.8369548916816711
0 references
0.8347765803337097
0 references
