Pages that link to "Item:Q2419358"

The following pages link to The price of anarchy for utilitarian scheduling games on related machines (Q2419358):

Displaying 27 items.

• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
• Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
• Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
• A selfish allocation heuristic in scheduling: equilibrium and inefficiency bound analysis (Q1622818) (← links)
• A parallel machine schedule updating game with compensations and clients averse to uncertain loss (Q1634066) (← 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)
• The price of fairness for a two-agent scheduling game minimizing total completion time (Q2082220) (← links)
• Race scheduling games (Q2109966) (← links)
• Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
• The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
• The power of one evil secret agent (Q2196556) (← links)
• An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (Q2250443) (← links)
• Multistage interval scheduling games (Q2283299) (← links)
• Price of anarchy and price of stability in multi-agent project scheduling (Q2288992) (← links)
• Improved price of anarchy for machine scheduling games with coordination mechanisms (Q2311122) (← links)
• A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
• Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
• The Price of Anarchy for Minsum Related Machine Scheduling (Q2896395) (← links)
• The power of one secret agent (Q3301024) (← links)
• (Q4574476) (← links)
• Scheduling games with machine-dependent priority lists (Q5896089) (← links)
• Scheduling games with rank-based utilities (Q6160122) (← links)
• Choosing a batch to be processed (Q6165388) (← links)
• Minimizing total completion time with machine-dependent priority lists (Q6586213) (← links)