Pages that link to "Item:Q1762998"

The following pages link to Approximate equilibria and ball fusion (Q1762998):

Displaying 40 items.

• Tight bounds for parallel randomized load balancing (Q287991) (← links)
• Nonpreemptive coordination mechanisms for identical machines (Q372964) (← 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)
• Worst-case equilibria (Q458478) (← links)
• Strong stability of Nash equilibria in load balancing games (Q477108) (← links)
• Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
• Selfish bin packing (Q534779) (← links)
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy (Q611044) (← links)
• Tight bounds for selfish and greedy load balancing (Q644806) (← links)
• On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
• The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
• Coordination mechanisms (Q838145) (← links)
• Atomic routing games on maximum congestion (Q838146) (← links)
• The price of anarchy for polynomial social cost (Q861255) (← links)
• On the structure and complexity of worst-case equilibria (Q883997) (← links)
• The strong price of anarchy of linear bottleneck congestion games (Q905688) (← links)
• Scheduling to maximize participation (Q935466) (← links)
• Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
• A new model for selfish routing (Q952441) (← links)
• Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
• Selfish load balancing for jobs with favorite machines (Q2294253) (← links)
• On weighted balls-into-bins games (Q2378532) (← links)
• Scheduling selfish jobs on multidimensional parallel machines (Q2404079) (← links)
• Selfish routing with incomplete information (Q2471698) (← links)
• Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
• Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
• Selfish unsplittable flows (Q2581267) (← links)
• Parallel load balancing on constrained client-server topologies (Q2664933) (← links)
• Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
• On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531) (← links)
• The Price of Matching with Metric Preferences (Q3452808) (← links)
• A Glimpse at Paul G. Spirakis (Q3464465) (← links)
• A Selective Tour Through Congestion Games (Q3464474) (← links)
• Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games (Q3511399) (← links)
• Selfish Bin Packing (Q3541100) (← links)
• Scheduling to Maximize Participation (Q3608460) (← links)
• The Price of Anarchy on Uniformly Related Machines Revisited (Q5459971) (← links)
• Which is the worst-case Nash equilibrium? (Q6552473) (← links)
• Sequential solutions in machine scheduling games (Q6620466) (← links)