The following pages link to How bad is selfish routing? (Q3196642):
Displaying 50 items.
- Equilibrium network design of shared-vehicle systems (Q2256243) (← links)
- Auctioning or assigning an object: some remarkable VCG mechanisms (Q2268363) (← links)
- Evolutionary equilibrium in Bayesian routing games: specialization and niche formation (Q2268863) (← links)
- Two-group knapsack game (Q2268867) (← links)
- Computer science and decision theory (Q2271874) (← links)
- Achieving target equilibria in network routing games without knowing the latency functions (Q2278946) (← links)
- The price of anarchy of affine congestion games with similar strategies (Q2285160) (← links)
- Dynamic resource allocation games (Q2286736) (← links)
- Recursively modeling other agents for decision making: a research perspective (Q2287201) (← links)
- The sequential price of anarchy for affine congestion games with few players (Q2294284) (← links)
- Exact enforcement value of soft correlated equilibrium for generalized chicken and prisoner's dilemma games (Q2303330) (← links)
- Quality of strong equilibria for selfish bin packing with uniform cost sharing (Q2304118) (← links)
- Pathwise smooth splittable congestion games and inefficiency (Q2304200) (← links)
- The linear hidden subset problem for the \((1 + 1)\) EA with scheduled and adaptive mutation rates (Q2315023) (← links)
- Heterogeneity and chaos in congestion games (Q2335582) (← links)
- A mixed traffic assignment problem and its upper bound of efficiency loss (Q2336305) (← links)
- Some anomalies of farsighted strategic behavior (Q2344212) (← links)
- Self-adjusting grid networks to minimize expected path length (Q2345461) (← links)
- Bounds on price of anarchy on linear cost functions (Q2351278) (← links)
- Inefficiency of the Nash equilibrium for selfish machine covering on two hierarchical uniform machines (Q2353644) (← links)
- On the sequential price of anarchy of isolation games (Q2354304) (← links)
- On spectrum sharing games (Q2377140) (← links)
- Greedy distributed optimization of multi-commodity flows (Q2377262) (← links)
- On the convergence of multicast games in directed networks (Q2379922) (← links)
- On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands (Q2389520) (← links)
- Collusion in atomic splittable routing games (Q2392243) (← links)
- A note on a selfish bin packing problem (Q2393075) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- Wary of the worst: maximizing award guarantees when new claimants may arrive (Q2411533) (← links)
- Agent incentives of a proportional sharing mechanism in resource sharing (Q2420658) (← links)
- On equilibria for ADM minimization games (Q2429352) (← links)
- Demand allocation with latency cost functions (Q2429466) (← links)
- Efficiency analysis of load balancing games with and without activation costs (Q2434275) (← links)
- Online bottleneck matching (Q2436671) (← links)
- Approximate strong equilibria in job scheduling games with two uniformly related machines (Q2446828) (← links)
- Stability vs. optimality in selfish ring routing (Q2453835) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- The worst absolute surplus loss in the problem of commons: random priority versus average cost (Q2460223) (← links)
- The toll effect on price of anarchy when costs are nonlinear and asymmetric (Q2462125) (← links)
- Bounding the inefficiency of Nash equilibria in games with finitely many players (Q2467438) (← links)
- Mixed Nash equilibria in selfish routing problems with dynamic constraints (Q2481950) (← links)
- An overview of Stackelberg pricing in networks (Q2482810) (← links)
- How much can taxes help selfish routing? (Q2495395) (← links)
- On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
- Tradeoffs in worst-case equilibria (Q2503349) (← links)
- On the efficiency of equilibria in mean-field oscillator games (Q2514576) (← links)
- The uniqueness property for networks with several origin-destination pairs (Q2514826) (← links)
- Introduction to the special issue -- Algorithmic game theory -- STOC/FOCS/SODA 2011 (Q2516241) (← links)
- Optimal deterministic auctions with correlated priors (Q2516251) (← links)
- A geometric approach to the price of anarchy in nonatomic congestion games (Q2519480) (← links)
