Computing the Nash solution for scheduling bargaining problems (Q840625)
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: Computing the Nash solution for scheduling bargaining problems |
scientific article; zbMATH DE number 5603413
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the Nash solution for scheduling bargaining problems |
scientific article; zbMATH DE number 5603413 |
Statements
Computing the Nash solution for scheduling bargaining problems (English)
0 references
13 September 2009
0 references
Summary: In this paper we focus on the Nash bargaining solution (NBS) in a scheduling scenario with two players. The problem is shown to be NP-hard, but an effective computing scheme for finding NBS is presented. Extensive computational results are provided, showing that NBS can always be found within reasonable computation time.
0 references
multi-agent scheduling
0 references
Nash bargaining solutions
0 references
complexity
0 references
NP-hardness
0 references
