Nash equilibrium solutions in multi-agent project scheduling with milestones

DOI10.1016/J.EJOR.2021.01.023MaRDI QIDQ2031069zbMATH OpenOpenAlexFDO

Authors Alessandro Agnetis, Marko Šidlovský, Cyril Briand, Přemysl Šůcha

Publication date 8 June 2021

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2021.01.023

zbMATH Keywords

Nash equilibriaproject schedulingflow networksmilestoneslazy-constraint generation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80)

Recommendations

• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
• Price of anarchy and price of stability in multi-agent project scheduling
• Nash equilibria in competitive project scheduling
• A \((\mu ,\, \lambda )\)-coordination mechanism for agent-based multi-project scheduling

Cites work

• A game theoretical approach to sharing penalties and rewards in projects
• A market-based multi-agent system model for decentralized multi-project scheduling
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
• How to apply penalties to avoid delays in projects
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Nash equilibria in competitive project scheduling
• Network flows. Theory, algorithms, and applications.
• On a linear-programming, combinatorial approach to the traveling-salesman problem
• Phase transitions in project scheduling
• Price of anarchy and price of stability in multi-agent project scheduling
• Project scheduling. A research handbook.
• Rangen: A random network generator for activity-on-the-node networks
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
• Two approaches to the problem of sharing delay costs in joint projects

Cited in

(5)

• Nash equilibria in competitive project scheduling
• Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Price of anarchy and price of stability in multi-agent project scheduling
• Single-machine scheduling of multiple projects with controllable processing times

Describes a project that uses

Uses Software

• RanGen

This page was built for publication: Nash equilibrium solutions in multi-agent project scheduling with milestones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2031069)