The following pages link to How bad is selfish routing? (Q3196642):
Displaying 50 items.
- On the Braess paradox with nonlinear dynamics and control theory (Q255086) (← links)
- Parametric packing of selfish items and the subset sum algorithm (Q261356) (← links)
- Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games (Q301158) (← links)
- Computational social choice for coordination in agent networks (Q314440) (← links)
- Strategic decentralization in binary choice composite congestion games (Q322512) (← links)
- Network design to anticipate selfish evacuation routing (Q339932) (← links)
- The combination of continuous network design and route guidance (Q342420) (← links)
- Serve or skip: the power of rejection in online bottleneck matching (Q346521) (← links)
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- Toward microeconomic allocation of resources in multi-service overlay networks (Q353696) (← links)
- Nonpreemptive coordination mechanisms for identical machines (Q372964) (← links)
- Braess's paradox for flows over time (Q372993) (← links)
- Social context congestion games (Q386894) (← links)
- Maximizing the minimum load: the cost of selfishness (Q390908) (← links)
- On the efficiency of price competition (Q408424) (← links)
- The price of anarchy on uniformly related machines revisited (Q418148) (← links)
- Monotonicity properties of user equilibrium policies for parallel batch systems (Q429998) (← links)
- Price of anarchy for supply chains with partial positive externalities (Q435738) (← links)
- Convergence and approximation in potential games (Q441854) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox (Q453657) (← links)
- Convergence of best-response dynamics in games with conflicting congestion effects (Q477597) (← links)
- Minimizing Rosenthal potential in multicast games (Q493648) (← links)
- On the efficiency of the proportional allocation mechanism for divisible resources (Q506522) (← links)
- Network characterizations for excluding Braess's paradox (Q506543) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Selfish bin packing (Q534779) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
- Restrictive mechanism of flow control among non-cooperative internet users (Q543151) (← links)
- A selfish routing based network improvement problem (Q545450) (← links)
- Connectivity and equilibrium in random games (Q549865) (← links)
- User equilibria for a parallel queueing system with state dependent routing (Q600903) (← links)
- A generalization of correlated equilibrium: a new protocol (Q607260) (← links)
- Decompositions and potentials for normal form games (Q608546) (← links)
- Action-graph games (Q625044) (← links)
- Buyer-supplier games: optimization over the core (Q627118) (← links)
- Local and global price of anarchy of graphical games (Q631783) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks (Q639277) (← links)
- Graphical congestion games (Q639291) (← links)
- Congestion games with failures (Q642974) (← links)
- Tight bounds for selfish and greedy load balancing (Q644806) (← links)
- Truthful mechanisms for selfish routing and two-parameter agents (Q647482) (← links)
- Nash equilibria and the price of anarchy for flows over time (Q647485) (← links)
- Design of price mechanisms for network resource allocation via price of anarchy (Q662298) (← links)
- Cooperative power-aware scheduling in grid computing environments (Q666017) (← links)
- Synthesis from component libraries with costs (Q683714) (← links)
