Pages that link to "Item:Q2944540"

The following pages link to Tight bounds for worst-case equilibria (Q2944540):

Displaying 50 items.

• Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
• 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)
• Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
• On the second point-to-point undirected shortest simple path problem (Q395858) (← links)
• Smoothed performance guarantees for local search (Q403643) (← links)
• Selfish bin coloring (Q411255) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
• Performance guarantees for scheduling algorithms under perturbed machine speeds (Q496438) (← links)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
• Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
• Coordination mechanisms for scheduling selfish jobs with favorite machines (Q782743) (← links)
• The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
• On the structure and complexity of worst-case equilibria (Q883997) (← links)
• Inefficiency of equilibria for scheduling game with machine activation costs (Q897948) (← links)
• The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
• A new model for selfish routing (Q952441) (← links)
• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• Efficiency analysis with respect to the unit cost objectives in scheduling games (Q1645201) (← links)
• The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information (Q2156302) (← links)
• Multi-round cooperative search games with multiple players (Q2186824) (← links)
• The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler (Q2197545) (← links)
• Multistage interval scheduling games (Q2283299) (← links)
• The price of anarchy of affine congestion games with similar strategies (Q2285160) (← 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)
• Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
• On the sequential price of anarchy of isolation games (Q2354304) (← links)
• Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
• Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
• Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
• The price of anarchy for utilitarian scheduling games on related machines (Q2419358) (← links)
• Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
• Selfish routing with incomplete information (Q2471698) (← links)
• Tradeoffs in worst-case equilibria (Q2503349) (← links)
• Coordinating oligopolistic players in unrelated machine scheduling (Q2514126) (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
• The price of anarchy in nonatomic consumption-relevance congestion games (Q2811296) (← links)
• The complexity of welfare maximization in congestion games (Q2892161) (← links)
• Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
• Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
• On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
• Selfish Bin Packing (Q3541100) (← links)
• (Q5092351) (← links)
• The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
• Scheduling games with machine-dependent priority lists (Q5896089) (← links)
• Approximation and Online Algorithms (Q5896921) (← links)
• Load rebalancing games in dynamic systems with migration costs (Q5964072) (← links)