Pages that link to "Item:Q3579231"
From MaRDI portal
The following pages link to Selfish traffic allocation for server farms (Q3579231):
Displaying 19 items.
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- The path player game (Q1006556) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- On spectrum sharing games (Q2377140) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- The Influence of Link Restrictions on (Random) Selfish Routing (Q5459969) (← links)
- The price of anarchy is independent of the network topology (Q5917582) (← links)
