On the complexity of nucleolus computation for bipartite \(b\)-matching games (Q6129697)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the complexity of nucleolus computation for bipartite b-matching games |
scientific article; zbMATH DE number 7833678
| 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 7833678 |
Statements
On the complexity of nucleolus computation for bipartite \(b\)-matching games (English)
0 references
17 April 2024
0 references
algorithmic game theory
0 references
combinatorial optimization
0 references
matching games
0 references
cooperative game theory
0 references
linear programming
0 references
complexity theory
0 references
0.997489869594574
0 references
0.84480220079422
0 references
0.8406723737716675
0 references
0.8349558711051941
0 references
0.8341238498687744
0 references
