Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory (Q1278742)
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: Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory |
scientific article; zbMATH DE number 1253242
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory |
scientific article; zbMATH DE number 1253242 |
Statements
Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory (English)
0 references
22 February 1999
0 references
lexminmax optimization
0 references
nucleolus
0 references
cooperative \(n\)-person-game
0 references
0 references
0.9144012
0 references
0.87261915
0 references
0.8722769
0 references
0 references
0.86839765
0 references
0.8672608
0 references
0.86690104
0 references
0.86473256
0 references
