scientific article; zbMATH DE number 6469241
From MaRDI portal
Publication:5501360
Cited in
(61)- The price of anarchy is independent of the network topology
- Braess's Paradox in large random graphs
- On the Braess paradox with nonlinear dynamics and control theory
- Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
- Optimal evacuation solutions for large-scale scenarios
- Parametric packing of selfish items and the subset sum algorithm
- Resolving Braess's paradox in random networks
- New complexity results and algorithms for the minimum tollbooth problem
- Coincident cost improvement vs. Degradation by adding connections to noncooperative networks and distributed systems
- Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
- Cost sharing in networks: some open questions
- Learning efficient Nash equilibria in distributed systems
- A Stackelberg strategy for routing flow over time
- Efficiency of atomic splittable selfish routing with polynomial cost functions
- Computer-aided verification for mechanism design
- The effect of supplier capacity on the supply chain profit
- Advances in dynamic traffic assignment: TAC. A new relationship between Wardrop's user equilibrium and Nash equilibrium
- Foundations of mechanism design: a tutorial. I. Key concepts and classical results
- A network efficiency measure with application to critical infrastructure networks
- The cost of selfishness for maximizing the minimum load on uniformly related machines
- Repeated congestion games with bounded rationality
- Optimal routing and charging of energy-limited vehicles in traffic networks
- Sensitivity analysis for convex separable optimization over integral polymatroids
- The path player game
- Adaptive routing with stale information
- Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- On the performance of approximate equilibria in congestion games
- Improving selfish routing for risk-averse players
- Hierarchical models of warfare
- Atomic routing games on maximum congestion
- Incentive compatible and globally efficient position based routing for selfish reverse multicast in wireless sensor networks
- Complexity and optimality of the best response algorithm in random potential games
- Efficient graph topologies in network routing games
- Stackelberg strategies for selfish routing in general multicommodity networks
- Management of Variable Data Streams in Networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- A note on a selfish bin packing problem
- Stackelberg strategies and collusion in network games with splittable flow
- Demand allocation with latency cost functions
- Inefficiency of pure Nash equilibria in series-parallel network congestion games
- Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
- Bottleneck congestion games with logarithmic price of anarchy
- Price of stability in survivable network design
- Bottleneck links, variable demand, and the tragedy of the commons
- Stackelberg Strategies and Collusion in Network Games with Splittable Flow
- Nash equilibria and the price of anarchy for flows over time
- Truthful mechanisms for selfish routing and two-parameter agents
- Incentive-based search for equilibria in Boolean games
- A relative total cost index for the evaluation of transportation network robustness in the presence of degradable links and alternative travel behavior
- Fragile networks: identifying vulnerabilities and synergies in an uncertain age
- Greedy versus social: resource-competing oscillator network as a model of amoeba-based neurocomputer
- Bounding the inefficiency of the C-logit stochastic user equilibrium assignment
- Fair linking mechanisms for resource allocation with correlated player types
- The internet, evolutionary variational inequalities, and the time-dependent Braess paradox
- A continuous theory of traffic congestion and Wardrop equilibria
- Computer science and decision theory
- Approximate Nash equilibria in anonymous games
- Computing equilibria: a computational complexity perspective
- Interplay between security providers, consumers, and attackers: a weighted congestion game approach
- Collusion in atomic splittable routing games
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501360)
