We consider a project scheduling environment in which the activities are partitioned among a set of agents. The owner of each activity can decide its length, which is linearly related to its cost within a minimum (crash) and a maximum (normal) length. For each day the project makespan is reduced with respect to its normal value, a reward is offered to the agents, and each agent receives a given ratio of the reward. As in classical game theory, we assume that the agents’ parameters are common knowledge. We study the Nash equilibria of the corresponding non-cooperative game as a desired state where no agent is motivated to change his/her decision. Regarding project makespan as an overall measure of efficiency, here we consider the worst and the best Nash equilibria (i.e., for which makespan is maximum and, respectively, minimum among Nash equilibria). We show that the problem of finding the worst Nash equilibrium is NP-hard (finding the best Nash equilibrium is already known to be strongly NP-hard), and propose an ILP formulation for its computation. We then investigate the values of the price of anarchy and the price of stability in a large sample of realistic size problems and get useful insights for the project owner.
|Titolo:||Price of anarchy and price of stability in multi-agent project scheduling|
AGNETIS, ALESSANDRO (Corresponding)
|Citazione:||Agnetis, A., Briand, C., Ngueveu, S.U., & Sucha, P. (2019). Price of anarchy and price of stability in multi-agent project scheduling. ANNALS OF OPERATIONS RESEARCH.|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto: