The following pages link to Strong price of anarchy (Q1007765):
Displaying 50 items.
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Cost-sharing scheduling games on restricted unrelated machines (Q306273) (← links)
- On the complexity of Pareto-optimal Nash and strong equilibria (Q372955) (← links)
- Computing pure Nash and strong equilibria in bottleneck congestion games (Q378094) (← links)
- Implementing efficient graphs in connection networks (Q382330) (← links)
- Multitask \(n\)-vehicle exploration problem: complexity and algorithm (Q394382) (← links)
- Selfish bin coloring (Q411255) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Item bidding for combinatorial public projects (Q526903) (← links)
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Competitive routing over time (Q719282) (← links)
- Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
- Equilibria in a class of aggregative location games (Q898688) (← links)
- Coordination games on graphs (Q1677255) (← links)
- The intermediate price of anarchy (IPoA) in bin packing games (Q1744237) (← links)
- Strategic cooperation in cost sharing games (Q1939521) (← links)
- Selfish vector packing (Q1979465) (← links)
- On the tree conjecture for the network creation game (Q1987511) (← links)
- A game-theoretical model of the landscape theory (Q1996175) (← links)
- Strong Nash equilibria and mixed strategies (Q2021821) (← links)
- Negotiating team formation using deep reinforcement learning (Q2046007) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- Transportation network with externalities (Q2196061) (← links)
- Quality of equilibria for selfish bin packing with cost sharing variants (Q2218642) (← links)
- Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- A note on the lower bound for the price of anarchy of scheduling games on unrelated machines (Q2345623) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
- Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
- Pareto optimal equilibria for selfish bin packing with uniform cost sharing (Q2424651) (← links)
- Contribution games in networks (Q2429340) (← links)
- On equilibria for ADM minimization games (Q2429352) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Congestion Games with Multi-Dimensional Demands (Q2807005) (← links)
- Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
- On the Complexity of Pareto-optimal Nash and Strong Equilibria (Q3162529) (← links)
- On the Tree Conjecture for the Network Creation Game (Q3304108) (← links)
- Cost-Sharing Scheduling Games on Restricted Unrelated Machines (Q3449583) (← links)
- Selfish Vector Packing (Q3452809) (← links)
- Efficient Black-Box Reductions for Separable Cost Sharing (Q4991670) (← links)
- (Q5002844) (← links)
- Balancing Load via Small Coalitions in Selfish Ring Routing Games (Q5245837) (← links)
- Equilibria in Multiclass and Multidimensional Atomic Congestion Games (Q5870354) (← links)
- On the Existence of Pure Nash Equilibria in Weighted Congestion Games (Q5891841) (← links)
- Cost-sharing games in real-time scheduling systems (Q5918882) (← links)
- Generalized graph \(k\)-coloring games (Q5918905) (← links)