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

DOI10.1007/s10951-017-0516-2zbMath1391.90245OpenAlexW2595729562MaRDI QIDQ1707826

Přemysl Šucha, Sandra Ulrich Ngueveu, Cyril Briand

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

project schedulingNash equilibriummixed integer programmingtime-cost trade-off

Mathematics Subject Classification ID

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

Related Items (4)

Integer programming methods to identify Nash equilibrium solutions for platform-based scheduling games ⋮ Sharing delay costs in stochastic scheduling problems with delays ⋮ Nash equilibrium solutions in multi-agent project scheduling with milestones ⋮ Price of anarchy and price of stability in multi-agent project scheduling

Uses Software

• RanGen

Cites Work

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

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