Pages that link to "Item:Q5704208"

The following pages link to Selfish Routing in Capacitated Networks (Q5704208):

Displaying 50 items.

• Selfish routing in public services (Q146294) (← links)
• Optimal cost sharing for capacitated facility location games (Q297094) (← links)
• Computation of equilibria and the price of anarchy in bottleneck congestion games (Q301322) (← links)
• Network-formation games with regular objectives (Q342715) (← links)
• Price of anarchy for supply chains with partial positive externalities (Q435738) (← links)
• Efficient methods for selfish network design (Q442104) (← links)
• Repeated congestion games with bounded rationality (Q444148) (← links)
• Price of anarchy and an approximation algorithm for the binary-preference capacitated selfish replication game (Q503156) (← 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)
• Connectivity and equilibrium in random games (Q549865) (← links)
• On the performance of approximate equilibria in congestion games (Q634681) (← links)
• Competitive online multicommodity routing (Q839644) (← links)
• Capacitated network design games (Q904684) (← links)
• Congestion games with capacitated resources (Q904685) (← 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)
• Profit loss in differentiated oligopolies (Q1002084) (← links)
• The path player game (Q1006556) (← links)
• Edge pricing of multicommodity networks for selfish users with elastic demands (Q1014793) (← links)
• Existence of equilibria in a decentralized two-level supply chain (Q1014973) (← 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)
• Decomposition algorithm model for singly linearly-constrained problems subject to lower and Upper bounds (Q1029281) (← links)
• Bounding the inefficiency of logit-based stochastic user equilibrium (Q1037672) (← links)
• Efficiency analysis with respect to the unit cost objectives in scheduling games (Q1645201) (← links)
• Price of anarchy for highly congested routing games in parallel networks (Q1733382) (← links)
• Toll caps in privatized road networks (Q1734347) (← links)
• Price of anarchy in a linear-state stochastic dynamic game (Q1751708) (← links)
• Tighter bounds on the inefficiency ratio of stable equilibria in load balancing games (Q1755838) (← links)
• Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training (Q1790674) (← links)
• Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439) (← links)
• A network pricing game for selfish traffic (Q1954204) (← 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)
• Price of Pareto optimality in hedonic games (Q2046008) (← links)
• Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks (Q2058026) (← links)
• Atomic congestion games with random players: network equilibrium and the price of anarchy (Q2082222) (← links)
• On Pareto optimality in social distance games (Q2093365) (← links)
• A unifying approximate potential for weighted congestion games (Q2109950) (← links)
• Nonatomic aggregative games with infinitely many types (Q2140304) (← links)
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information (Q2156302) (← links)
• Atomic routing game with capacity constraints (Q2173050) (← links)
• Computation and efficiency of potential function minimizers of combinatorial congestion games (Q2235157) (← links)