The following pages link to (Q4828962):
Displaying 50 items.
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Worst-case equilibria (Q458478) (← links)
- Strong stability of Nash equilibria in load balancing games (Q477108) (← links)
- Selfish bin packing (Q534779) (← links)
- Connectivity and equilibrium in random games (Q549865) (← 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)
- Non-clairvoyant scheduling games (Q647492) (← links)
- Load balancing without regret in the bulletin board model (Q661046) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Inefficiency of equilibria for the machine covering game on uniform machines (Q715052) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- On the complexity of constrained Nash equilibria in graphical games (Q837182) (← links)
- Coordination mechanisms (Q838145) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- On the structure and complexity of worst-case equilibria (Q883997) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- How to find Nash equilibria with extreme total latency in network congestion games? (Q966426) (← links)
- Equilibria for networks with malicious users (Q985313) (← links)
- Price of anarchy in parallel processing (Q991788) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Coordination mechanisms for selfish scheduling (Q1014630) (← links)
- Efficient graph topologies in network routing games (Q1021587) (← links)
- How hard is it to find extreme Nash equilibria in network congestion games? (Q1034618) (← links)
- Coordination mechanisms for parallel machine scheduling (Q1926738) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- Two-group knapsack game (Q2268867) (← links)
- The shortest first coordination mechanism for a scheduling game with parallel-batching machines (Q2361588) (← links)
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands (Q2389520) (← links)
- Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
- Inefficiency of Nash equilibria with parallel processing policy (Q2444737) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
- Anarchy Is Free in Network Creation (Q2938033) (← links)
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling (Q3450455) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games (Q3511399) (← links)
- Scheduling to Maximize Participation (Q3608460) (← links)
- A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines (Q4689392) (← links)
- Nonadaptive Selfish Routing with Online Demands (Q5458504) (← links)
- The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← links)
