Computing the Nash solution for scheduling bargaining problems. (2nd June 2009)
- Record Type:
- Journal Article
- Title:
- Computing the Nash solution for scheduling bargaining problems. (2nd June 2009)
- Main Title:
- Computing the Nash solution for scheduling bargaining problems
- Authors:
- Agnetis, Alessandro
De Pascale, Gianluca
Pranzo, Marco - Abstract:
- 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.
- Is Part Of:
- International journal of operational research. Volume 6:Number 1(2009)
- Journal:
- International journal of operational research
- Issue:
- Volume 6:Number 1(2009)
- Issue Display:
- Volume 6, Issue 1 (2009)
- Year:
- 2009
- Volume:
- 6
- Issue:
- 1
- Issue Sort Value:
- 2009-0006-0001-0000
- Page Start:
- 54
- Page End:
- 69
- Publication Date:
- 2009-06-02
- Subjects:
- multi-agent scheduling -- Nash bargaining solutions -- complexity -- NP-hardness
Operations research -- Periodicals
003.05 - Journal URLs:
- http://www.inderscience.com/browse/index.php?journalID=170 ↗
http://www.inderscience.com/ ↗ - Languages:
- English
- ISSNs:
- 1745-7645
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - BLDSS-3PM
British Library STI - ELD Digital store - Ingest File:
- 8873.xml