Reducing the number of linear programs needed for solving the nucleolus problem of \(n\)-person game theory (Q1278742): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743 |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 09:55, 14 March 2024
scientific article
| 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 |
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
