Pages that link to "Item:Q2311122"

The following pages link to Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122):

Displaying 17 items.

• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
• Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
• Price of anarchy in parallel processing (Q991788) (← links)
• A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← links)
• Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
• The price of anarchy in two-stage scheduling games (Q1708612) (← links)
• On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (Q2250443) (← links)
• Research on optimization of production decision based on payment time and price coordination (Q2290936) (← links)
• A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
• The price of anarchy for utilitarian scheduling games on related machines (Q2419358) (← links)
• Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
• The Price of Anarchy for Minsum Related Machine Scheduling (Q2896395) (← links)
• (Q4574476) (← links)
• A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
• Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost (Q5024478) (← links)