The following pages link to How bad is selfish routing? (Q3196642):
Displaying 50 items.
- Game-theoretic analysis of Internet switching with selfish users (Q714792) (← links)
- Microeconomics-based resource allocation in overlay networks by using non-strategic behavior modeling (Q718343) (← links)
- The Pareto frontier of inefficiency in mechanism design (Q777959) (← links)
- Topological price of anarchy bounds for clustering games on networks (Q777968) (← links)
- The no-wait flow-shop paradox (Q813966) (← links)
- Strong mediated equilibrium (Q834404) (← links)
- Congestion games with malicious players (Q834852) (← links)
- Strong equilibrium in cost sharing connection games (Q834855) (← links)
- Stackelberg thresholds in network routing games or the value of altruism (Q834861) (← links)
- The impact of local policies on the quality of packet routing in paths, trees, and rings (Q835620) (← links)
- Coordination mechanisms (Q838145) (← links)
- Atomic routing games on maximum congestion (Q838146) (← links)
- Adaptive routing with stale information (Q838148) (← links)
- Competitive online multicommodity routing (Q839644) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Utilitarian resource assignment (Q866544) (← links)
- Agent-based randomized broadcasting in large networks (Q867856) (← links)
- Subjective-cost policy routing (Q883998) (← links)
- Transfer implementation in congestion games (Q888280) (← links)
- Capacitated network design games (Q904684) (← links)
- A paradox in a queueing network with state-dependent routing and loss (Q933905) (← links)
- The price of anarchy of serial, average and incremental cost sharing (Q934898) (← links)
- Scheduling to maximize participation (Q935466) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- Non-cooperative facility location and covering games (Q964406) (← links)
- Continuum equilibria and global optimization for routing in dense static ad hoc networks (Q969028) (← links)
- Optimal routing of vehicles with communication capabilities in disasters (Q970130) (← links)
- The price of atomic selfish ring routing (Q975753) (← links)
- Equilibria for networks with malicious users (Q985313) (← links)
- Sensitivity of Wardrop equilibria (Q987396) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- A note on a parameter relating traffic equilibria and system optimal routing (Q990457) (← links)
- An efficient and almost budget balanced cost sharing method (Q993789) (← links)
- The price of selfish routing (Q996709) (← links)
- Almost budget-balanced VCG mechanisms to assign multiple objects (Q1001816) (← links)
- Profit loss in differentiated oligopolies (Q1002084) (← links)
- Strong price of anarchy (Q1007765) (← links)
- Choice of routes in congested traffic networks: Experimental tests of the Braess paradox (Q1007778) (← links)
- Edge pricing of multicommodity networks for selfish users with elastic demands (Q1014793) (← links)
- Non-cooperative tree creation (Q1017908) (← links)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Price and capacity competition (Q1021581) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- Two-terminal routing games with unknown active players (Q1045998) (← links)
- The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. (Q1400339) (← links)
- Potential games, path independence and Poisson's binomial distribution (Q1616794) (← links)
- An abstraction-refinement methodology for reasoning about network games (Q1630443) (← links)
- Probabilistic selfish routing in parallel batch and single-server queues (Q1649977) (← links)
- Congestion avoiding heuristic path generation for the proactive route guidance (Q1654374) (← links)
- Strategic pricing in next-hop routing with elastic demands (Q1678765) (← links)
