IDEAS home Printed from https://ideas.repec.org/a/ids/ijores/v6y2009i1p54-69.html
   My bibliography  Save this article

Computing the Nash solution for scheduling bargaining problems

Author

Listed:
  • Alessandro Agnetis
  • Gianluca De Pascale
  • Marco Pranzo

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.

Suggested Citation

  • Alessandro Agnetis & Gianluca De Pascale & Marco Pranzo, 2009. "Computing the Nash solution for scheduling bargaining problems," International Journal of Operational Research, Inderscience Enterprises Ltd, vol. 6(1), pages 54-69.
    • Handle: RePEc:ids:ijores:v:6:y:2009:i:1:p:54-69
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=26243
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Agnetis, Alessandro & Chen, Bo & Nicosia, Gaia & Pacifici, Andrea, 2019. "Price of fairness in two-agent single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 276(1), pages 79-87.
    2. Lang, Fabian & Fink, Andreas & Brandt, Tobias, 2016. "Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling," European Journal of Operational Research, Elsevier, vol. 248(1), pages 192-203.
    3. Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijores:v:6:y:2009:i:1:p:54-69. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=170 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.