Nash equilibria in competitive project scheduling
From MaRDI portal
Publication:976353
DOI10.1016/J.EJOR.2010.02.012zbMATH Open1188.90117OpenAlexW2063085040MaRDI QIDQ976353FDOQ976353
Authors: Igor Averbakh 
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.02.012
Recommendations
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
- Nash equilibrium solutions in multi-agent project scheduling with milestones
- Nash equilibria for the multi-agent project scheduling problem with controllable processing times
- Project scheduling under competition
- Computing the Nash solution for scheduling bargaining problems
- Price of anarchy and price of stability in multi-agent project scheduling
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- Computing Nash equilibria for scheduling on restricted parallel links
- Strategic scheduling games: equilibria and efficiency
Cites Work
- Network flows. Theory, algorithms, and applications.
- Project scheduling under competition
- Pre-emption in resource-constrained project scheduling
- Project scheduling problem with mixed uncertainty of randomness and fuzziness
- GRASP and path relinking for project scheduling under partially renewable resources
- Production scheduling in a price competition
- Traveling salesmen in the presence of competition
- Nash equilibria solutions in the competitive salesmen problem on a network
Cited In (12)
- Title not available (Why is that?)
- On the complexity of project scheduling to minimize exposed time
- Finding an optimal Nash equilibrium to the multi-agent project scheduling problem
- Nash equilibria solutions in the competitive salesmen problem on a network
- Nash equilibria for the multi-agent project scheduling problem with controllable processing times
- Nash equilibrium solutions in multi-agent project scheduling with milestones
- Competitive project scheduling on two unbounded parallel batch machines
- Price of anarchy and price of stability in multi-agent project scheduling
- Multiequilibrium game of timing and competition of gas pipeline projects
- Computing the Nash solution for scheduling bargaining problems
- Coordination mechanisms for parallel machine scheduling
- Project scheduling under competition
This page was built for publication: Nash equilibria in competitive project scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976353)
