Pages that link to "Item:Q611044"
From MaRDI portal
The following pages link to Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044):
Displaying 18 items.
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis (Q389954) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Assignment games with conflicts: robust price of anarchy and convergence results via semi-smoothness (Q503458) (← links)
- Existence of anonymous link tolls for decentralizing an oligopolistic game and the efficiency analysis (Q549892) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- On the price of anarchy for high-price links (Q777977) (← links)
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Machine load balancing game with linear externalities (Q2096168) (← links)
- Online scheduling of jobs with favorite machines (Q2289948) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Price of Anarchy in the Link Destruction (Adversary) Model (Q2806943) (← links)
- The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
- Computing Nash equilibria for scheduling on restricted parallel links (Q5917951) (← links)
- Sequential solutions in machine scheduling games (Q6620466) (← links)
