Title: Computing the Nash solution for scheduling bargaining problems

Authors: Alessandro Agnetis, Gianluca De Pascale, Marco Pranzo

Addresses: Dipartimento di Ingegneria dell'Informazione, Universita di Siena, via Roma 56, 53100 Siena, Italy. ' Dipartimento di Ingegneria dell'Informazione, Universita di Siena, via Roma 56, 53100 Siena, Italy. ' Dipartimento di Ingegneria dell'Informazione, Universita di Siena, via Roma 56, 53100 Siena, Italy

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.

Keywords: multi-agent scheduling; Nash bargaining solutions; complexity; NP-hardness.

DOI: 10.1504/IJOR.2009.026243

International Journal of Operational Research, 2009 Vol.6 No.1, pp.54 - 69

Published online: 30 May 2009 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article