Pages that link to "Item:Q5917582"
From MaRDI portal
The following pages link to The price of anarchy is independent of the network topology (Q5917582):
Displaying 50 items.
- Selfish routing in public services (Q146294) (← links)
- Worst-case analysis of non-cooperative load balancing (Q291317) (← links)
- Allocation of flows in closed bipartite queueing networks (Q323531) (← links)
- Pairwise cooperations in selfish ring routing for minimax linear latency (Q443709) (← links)
- Extending the notion of rationality of selfish agents: second order Nash equilibria (Q533871) (← links)
- Stackelberg strategies and collusion in network games with splittable flow (Q538465) (← links)
- A selfish routing based network improvement problem (Q545450) (← links)
- On the price of anarchy for high-price links (Q777977) (← links)
- Adaptive routing with stale information (Q838148) (← links)
- Network topology and the efficiency of equilibrium (Q863283) (← 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)
- Stackelberg strategies for atomic congestion games (Q987387) (← 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)
- Stackelberg strategies for selfish routing in general multicommodity networks (Q1017909) (← links)
- Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
- Bounding the inefficiency of logit-based stochastic user equilibrium (Q1037672) (← links)
- Non-atomic one-round walks in congestion games (Q1731512) (← links)
- Price of anarchy for highly congested routing games in parallel networks (Q1733382) (← links)
- Toll caps in privatized road networks (Q1734347) (← links)
- Optimal externalities in a parallel transportation network (Q2162683) (← links)
- Routing-proofness in congestion-prone networks (Q2183993) (← links)
- Transportation network with externalities (Q2196061) (← links)
- Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)
- Inefficiency in stochastic queueing systems with strategic customers (Q2239838) (← 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)
- On a generalized Cournot oligopolistic competition game (Q2393078) (← links)
- Stability vs. optimality in selfish ring routing (Q2453835) (← links)
- The price of anarchy in an exponential multi-server (Q2457255) (← links)
- The worst absolute surplus loss in the problem of commons: random priority versus average cost (Q2460223) (← links)
- Bounding the inefficiency of Nash equilibria in games with finitely many players (Q2467438) (← 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)
- Optimal deterministic auctions with correlated priors (Q2516251) (← links)
- A geometric approach to the price of anarchy in nonatomic congestion games (Q2519480) (← links)
- Price of Anarchy in the Link Destruction (Adversary) Model (Q2806943) (← links)
- Efficiency of Equilibria in Uniform Matroid Congestion Games (Q2819451) (← links)
- On the Price of Anarchy of Highly Congested Nonatomic Network Games (Q2819452) (← links)
- A mean-risk model for the traffic assignment problem with stochastic travel times (Q2875605) (← links)
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
- The Price of Anarchy in Network Creation Games Is (Mostly) Constant (Q3162526) (← links)
- The Price of Matching with Metric Preferences (Q3452808) (← links)
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow (Q3602835) (← links)
- Management of Variable Data Streams in Networks (Q3637322) (← links)
