A note on the nucleolus of assignment games. (Q2753323)
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: A note on the nucleolus of assignment games. |
scientific article; zbMATH DE number 1667874
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the nucleolus of assignment games. |
scientific article; zbMATH DE number 1667874 |
Statements
26 September 2002
0 references
assignment game
0 references
A note on the nucleolus of assignment games. (English)
0 references
Let be a \((u,v)\)-person assignment game with \(v\geq u\). The author proposes an algorithm for finding the nucleolus which requires \(O(v^2u+v^4)\) time. The algorithm uses as a subroutine the algorithm of \textit{T. Solymosi} and \textit{T. E. S. Raghavan} [Int. J. Game Theory 23, No. 2, 119--143 (1994; Zbl 0811.90128)].NEWLINENEWLINEFor the entire collection see [Zbl 0969.00060].
0 references
0.9117104411125184
0 references
0.910334050655365
0 references
0.8369220495223999
0 references
0.8334308862686157
0 references
