| Article ID: | iaor200968959 |
| Country: | United Kingdom |
| Volume: | 6 |
| Issue: | 1 |
| Start Page Number: | 54 |
| End Page Number: | 69 |
| Publication Date: | May 2009 |
| Journal: | International Journal of Operational Research |
| Authors: | Agnetis Alessandro, Pranzo Marco, Pascale Gianluca De |
| Keywords: | Nash equilibrium |
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.