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.
Agnetis, A., DE PASCALE, G., Pranzo, M. (2009). Computing the Nash Solutions for Scheduling Bargaining Problems. INTERNATIONAL JOURNAL OF OPERATIONS RESEARCH, 6(1), 54-59 [10.1504/IJOR.2009.026243].
Computing the Nash Solutions for Scheduling Bargaining Problems
AGNETIS, ALESSANDRO;DE PASCALE, GIANLUCA;PRANZO, MARCO
2009-01-01
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.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/11365/11942
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo