Computing the Nash solution for scheduling bargaining problems
From MaRDI portal
Publication:840625
DOI10.1504/IJOR.2009.026243zbMath1169.90354OpenAlexW1982641276MaRDI QIDQ840625
Gianluca De Pascale, Marco Pranzo, Alessandro Agnetis
Publication date: 13 September 2009
Published in: International Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1504/ijor.2009.026243
Related Items (5)
Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Price of fairness in two-agent single-machine scheduling problems ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS ⋮ Scheduling two agent task chains with a central selection mechanism
This page was built for publication: Computing the Nash solution for scheduling bargaining problems
