Pages that link to "Item:Q3580944"

The following pages link to Convergence time to Nash equilibrium in load balancing (Q3580944):

Displaying 41 items.

• Concurrent imitation dynamics in congestion games (Q287990) (← links)
• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game (Q326996) (← links)
• Load balancing via random local search in closed and open systems (Q383274) (← links)
• Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
• \(\mathcal{NP}\)-hardness of pure Nash equilibrium in scheduling and network design games (Q390917) (← links)
• Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
• The price of anarchy on uniformly related machines revisited (Q418148) (← links)
• Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
• Characterizing the existence of potential functions in weighted congestion games (Q647489) (← links)
• Non-clairvoyant scheduling games (Q647492) (← links)
• Distributed algorithms for QoS load balancing (Q658665) (← links)
• Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
• Equilibria in a class of aggregative location games (Q898688) (← links)
• Congestion games with capacitated resources (Q904685) (← links)
• A new model for selfish routing (Q952441) (← links)
• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
• Security from the adversary's inertia-controlling convergence speed when playing mixed strategy equilibria (Q1630490) (← links)
• Distributed backup placement in networks (Q1741963) (← links)
• Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
• The cost of selfishness for maximizing the minimum load on uniformly related machines (Q2015810) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
• Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
• Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
• Efficient coordination mechanisms for unrelated machine scheduling (Q2375956) (← links)
• Strong equilibria in games with the lexicographical improvement property (Q2376067) (← links)
• On the convergence of multicast games in directed networks (Q2379922) (← links)
• Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
• Stability vs. optimality in selfish ring routing (Q2453835) (← links)
• Decentralized utilitarian mechanisms for scheduling games (Q2516246) (← links)
• Congestion games with variable demands (Q2800374) (← links)
• Convergence time to Nash equilibrium in selfish bin packing (Q2840533) (← links)
• Distributed Learning of Wardrop Equilibria (Q3543331) (← links)
• $\mathcal{NP}$ -Hardness of Pure Nash Equilibrium in Scheduling and Connection Games (Q3599089) (← links)
• Amortized Analysis of Asynchronous Price Dynamics (Q5009575) (← links)
• Prices of Anarchy of Selfish 2D Bin Packing Games (Q5384121) (← links)
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)
• A simple approach for adapting continuous load balancing processes to discrete settings (Q5890706) (← links)
• On the existence of pure Nash equilibria in weighted congestion games (Q5891841) (← links)