Pages that link to "Item:Q1885439"

The following pages link to Bounding the inefficiency of equilibria in nonatomic congestion games (Q1885439):

Displaying 50 items.

• Selfish routing in public services (Q146294) (← links)
• Pricing of fluctuations in electricity markets (Q319744) (← links)
• Existence of Nash equilibrium in games with a measure space of players and discontinuous payoff functions (Q403726) (← links)
• Repeated congestion games with bounded rationality (Q444148) (← links)
• Coarse matching with incomplete information (Q535167) (← links)
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS (Q542097) (← links)
• Prices of anarchy, information, and cooperation in differential games (Q545654) (← links)
• Connectivity and equilibrium in random games (Q549865) (← links)
• Buyer-supplier games: optimization over the core (Q627118) (← links)
• Convergence to approximate Nash equilibria in congestion games (Q632952) (← links)
• On the performance of approximate equilibria in congestion games (Q634681) (← 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)
• Design of price mechanisms for network resource allocation via price of anarchy (Q662298) (← links)
• Fragility of the commons under prospect-theoretic risk attitudes (Q738933) (← links)
• Atomic routing games on maximum congestion (Q838146) (← links)
• Adaptive routing with stale information (Q838148) (← links)
• Network topology and the efficiency of equilibrium (Q863283) (← links)
• Efficient graph topologies in network routing games (Q1021587) (← links)
• Efficiency of atomic splittable selfish routing with polynomial cost functions (Q1024062) (← links)
• Bounding the inefficiency of logit-based stochastic user equilibrium (Q1037672) (← links)
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. (Q1400339) (← links)
• Social optimality and cooperation in nonatomic congestion games. (Q1421898) (← links)
• Price of anarchy for highly congested routing games in parallel networks (Q1733382) (← links)
• Bounding the inefficiency of the C-logit stochastic user equilibrium assignment (Q2014426) (← links)
• On the price of anarchy of two-stage machine scheduling games (Q2051911) (← links)
• Estimating heterogeneous agent preferences by inverse optimization in a randomized nonatomic game (Q2070725) (← links)
• A note on network games with strategic complements and the Katz-Bonacich centrality measure (Q2072567) (← links)
• Atomic congestion games with random players: network equilibrium and the price of anarchy (Q2082222) (← links)
• Robust perfect equilibrium in large games (Q2138076) (← links)
• A traffic congestion analysis by user equilibrium and system optimum with incomplete information (Q2156302) (← links)
• The price of stability for undirected broadcast network design with fair cost allocation is constant (Q2206821) (← links)
• Nash-stable coalition partition and potential functions in games with coalition structure (Q2242407) (← links)
• Local smoothness and the price of anarchy in splittable congestion games (Q2253842) (← links)
• The effect of supplier capacity on the supply chain profit (Q2259017) (← links)
• Pathwise smooth splittable congestion games and inefficiency (Q2304200) (← links)
• Heterogeneity and chaos in congestion games (Q2335582) (← links)
• A mixed traffic assignment problem and its upper bound of efficiency loss (Q2336305) (← links)
• On a generalized Cournot oligopolistic competition game (Q2393078) (← links)
• Bounding the inefficiency of Nash equilibria in games with finitely many players (Q2467438) (← links)
• On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322) (← links)
• A geometric approach to the price of anarchy in nonatomic congestion games (Q2519480) (← links)
• Worst-case Nash equilibria in restricted routing (Q2637289) (← links)
• The price of anarchy in nonatomic consumption-relevance congestion games (Q2811296) (← links)
• On the Price of Anarchy of Highly Congested Nonatomic Network Games (Q2819452) (← links)
• Interplay between Security Providers, Consumers, and Attackers: A Weighted Congestion Game Approach (Q3098095) (← links)
• Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521) (← links)
• Models of Non-atomic Congestion Games – From Unicast to Multicast Routing (Q3637323) (← links)