Pages that link to "Item:Q5901071"

The following pages link to Computing Nash equilibria for scheduling on restricted parallel links (Q5901071):

Displaying 27 items.

• Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
• Reducing price of anarchy of selfish task allocation with more selfishness (Q393039) (← links)
• A coordination mechanism for a scheduling game with parallel-batching machines (Q511705) (← links)
• Tight bounds for selfish and greedy load balancing (Q644806) (← links)
• Non-clairvoyant scheduling games (Q647492) (← links)
• Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree (Q716177) (← links)
• The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
• Atomic routing games on maximum congestion (Q838146) (← links)
• On the structure and complexity of worst-case equilibria (Q883997) (← 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)
• Price of anarchy in parallel processing (Q991788) (← links)
• Pure Nash equilibria in player-specific and weighted congestion games (Q1014625) (← links)
• Coordination mechanisms for selfish scheduling (Q1014630) (← links)
• Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
• A strategic approach to multiple estate division problems (Q2345212) (← links)
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
• A faster combinatorial approximation algorithm for scheduling unrelated parallel machines (Q2373738) (← links)
• Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
• Multiindex resource distributions for hierarchical systems (Q2457591) (← links)
• Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
• Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
• Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
• The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← links)
• Project games (Q5925706) (← links)
• Nonatomic non-cooperative neighbourhood balancing games (Q6614537) (← links)