Finding an optimal Nash equilibrium to the multi-agent project scheduling problem

DOI10.1007/S10951-017-0516-2MaRDI QIDQ1707826zbMATH OpenOpenAlexFDO

Authors Cyril Briand, Sandra Ulrich Ngueveu, Přemysl Šůcha

Publication date 4 April 2018

Published in Journal of Scheduling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10951-017-0516-2

zbMATH Keywords

Nash equilibriummixed integer programmingproject schedulingtime-cost trade-off

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Noncooperative games (91A10) Mixed integer programming (90C11)

Recommendations

• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Nash equilibrium solutions in multi-agent project scheduling with milestones
• Price of anarchy and price of stability in multi-agent project scheduling
• Nash equilibria in competitive project scheduling
• Negotiation mechanisms for the multi-agent multi-mode resource investment problem

Cites work

• A Stackelberg hub arc location model for a competitive environment
• A game theoretical approach to sharing penalties and rewards in projects
• A survey of variants and extensions of the resource-constrained project scheduling problem
• Analyse de sensibilité pour les problèmes linéaires en variables 0-1
• Combinatorial Optimization. Polyhedra and efficiency. CD-ROM
• Directed maximal-cut problems
• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• Nash equilibria in competitive project scheduling
• Nearly serial sharing methods
• Project contracts and payment schedules: the client's problem
• Project crashing in the presence of general non-linear activity time reduction costs
• Rangen: A random network generator for activity-on-the-node networks
• Serial Cost Sharing
• Solving the Project Time/Cost Tradeoff Problem Using the Minimal Cut Concept
• The Impact of Contractor Behavior on the Client’s Payment-Scheduling Problem
• The discrete time-cost tradeoff problem revisited

Cited in

(11)

• Nash equilibria for the multi-agent project scheduling problem with controllable processing times
• An agency perspective for multi-mode project scheduling with time/cost trade-offs
• scientific article; zbMATH DE number 1054687 (Why is no real title available?)
• Nash equilibrium solutions in multi-agent project scheduling with milestones
• Nash equilibria in competitive project scheduling
• Sharing delay costs in stochastic scheduling problems with delays
• Price of anarchy and price of stability in multi-agent project scheduling
• Negotiation mechanisms for the multi-agent multi-mode resource investment problem
• Revenue sharing for resource reallocation among project activity contractors
• Generic negotiation mechanisms with side payments -- design, analysis and application for decentralized resource-constrained multi-project scheduling problems
• Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games

Describes a project that uses

Uses Software

• RanGen

This page was built for publication: Finding an optimal Nash equilibrium to the multi-agent project scheduling problem

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