The following pages link to How bad is selfish routing? (Q3196642):
Displaying 50 items.
- Wardrop equilibrium on time-varying graphs (Q1680914) (← links)
- Recent studies of agent incentives in internet resource allocation and pricing (Q1728405) (← links)
- Price of anarchy for highly congested routing games in parallel networks (Q1733382) (← links)
- Toll caps in privatized road networks (Q1734347) (← links)
- Competitive contagion in networks (Q1735734) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- Price of anarchy in a linear-state stochastic dynamic game (Q1751708) (← links)
- Avoiding routing loops on the internet (Q1762992) (← links)
- Network QoS games: stability vs optimality tradeoff (Q1880785) (← links)
- Approximation and collusion in multicast cost sharing (Q1885423) (← links)
- Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
- A BGP-based mechanism for lowest-cost routing (Q1953638) (← links)
- A network pricing game for selfish traffic (Q1954204) (← links)
- Designing fast converging cost sharing methods for multicast transmissions (Q1959383) (← links)
- Congestion control for a system with parallel stations and homogeneous customers using priority passes (Q2005824) (← links)
- Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery (Q2005923) (← links)
- Constraint games for stable and optimal allocation of demands in SDN (Q2009195) (← links)
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment (Q2014426) (← links)
- Equilibrium strategies for multiple interdictors on a common network (Q2028891) (← links)
- On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
- Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks (Q2058026) (← links)
- Urgency-aware optimal routing in repeated games through artificial currencies (Q2068548) (← links)
- Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game (Q2070725) (← links)
- On weak Pareto optimality of nonatomic routing networks (Q2082187) (← links)
- Atomic congestion games with random players: network equilibrium and the price of anarchy (Q2082222) (← links)
- Gathering avoiding centralized pedestrian advice framework: an application for Covid-19 outbreak restrictions (Q2089612) (← links)
- Machine load balancing game with linear externalities (Q2096168) (← links)
- A game-theoretic perspective of deep neural networks (Q2098170) (← links)
- Timed network games (Q2112796) (← links)
- Robust perfect equilibrium in large games (Q2138076) (← links)
- Modelling equilibrium for a multi-criteria selfish routing network equilibrium flow problem (Q2146721) (← links)
- The Price of Anarchy of generic valid utility systems (Q2149873) (← links)
- A game-theoretic analysis of deep neural networks (Q2151381) (← links)
- Beyond Pigouvian taxes: a worst case analysis (Q2152117) (← links)
- A traffic congestion analysis by user equilibrium and system optimum with incomplete information (Q2156302) (← links)
- Primary versus secondary infrastructure capacity allocation mechanisms (Q2158023) (← links)
- Recent studies of agent incentives in Internet resource allocation and pricing (Q2159522) (← links)
- Optimal externalities in a parallel transportation network (Q2162683) (← links)
- Sensitivity of wardrop equilibria: revisited (Q2174917) (← links)
- The quality of equilibria for set packing and throughput scheduling games (Q2178650) (← links)
- Incentives and coordination in bottleneck models (Q2190379) (← links)
- Equilibrium and inefficiency in multi-product Cournot games (Q2190395) (← links)
- Equilibria in routing games with edge priorities (Q2190414) (← links)
- Smart routing of electric vehicles for load balancing in smart grids (Q2203089) (← links)
- The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
- The minimum tollbooth problem in atomic network congestion games with unsplittable flows (Q2230724) (← links)
- Improving the price of anarchy for selfish routing via coordination mechanisms (Q2249743) (← links)
- Introduction to computer science and economic theory (Q2253830) (← links)
- Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
- On cost sharing in the provision of a binary and excludable public good (Q2254034) (← links)
