scientific article; zbMATH DE number 2079324

MaRDI QIDQ4471277zbMATH OpenFDO

Authors Andreas S. Schulz, N. E. Stier-Moses

Publication date 28 July 2004

zbMATH Keywords

performancetraffic planning

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Recommendations

• Selfish Routing in Capacitated Networks
• scientific article; zbMATH DE number 2119661
• Comparisons among several generalized network equilibriums with capacity constraints
• System optimal routing of traffic flows with user constraints using linear programming
• Approximation and Online Algorithms

Cited in

(42)

• A parallel machine schedule updating game with compensations and clients averse to uncertain loss
• An \(N\)-path user equilibrium for transportation networks
• Capacity-constrained wardrop equilibria and application to multi-connectivity in 5G networks
• Computing dynamic user equilibrium on large-scale networks without knowing global parameters
• Dynamic resource allocation games
• Geometric spanner games
• Implementation of optimal schedules in outsourcing with identical suppliers
• The anarchy of scheduling without money
• Equilibrium analysis through separation of user and network behavior
• Worst-case Nash equilibria in restricted routing
• Equilibrium computation of the Hart and Mas-Colell bargaining model
• Dynamic resource allocation games
• Sharing non-anonymous costs of multiple resources optimally
• Cost-sharing scheduling games on restricted unrelated machines
• Efficiency and fairness of system-optimal routing with user constraints
• Further results on capacitated network design games
• Cost-sharing scheduling games on restricted unrelated machines
• The price of matching with metric preferences
• Cooperation in Multiorganization Matching
• Traffic Network Equilibria with Rational Expectations.
• System Optimum, Stochastic User Equilibrium, and Optimal Link Tolls
• Dynamic Atomic Congestion Games with Seasonal Flows
• The price of stability of weighted congestion games
• Location Games on Networks: Existence and Efficiency of Equilibria
• The price of stability of weighted congestion games
• Network sharing by two mobile operators: beyond competition, cooperation
• The buck-passing game
• The price of anarchy is independent of the network topology
• Cost-sharing games in real-time scheduling systems
• Cost-sharing games with rank-based utilities
• scientific article; zbMATH DE number 7720022 (Why is no real title available?)
• Bridging the user equilibrium and the system optimum in static traffic assignment: how the cooperation among drivers can solve the congestion problem in city networks
• Selfish bin covering
• On priority-proportional payments in financial networks
• Nonatomic non-cooperative neighbourhood balancing games
• Cost-sharing games with rank-based utilities
• Popularity in location games
• When effort may fail: equilibria of shared effort with a threshold
• Network design with weighted players
• Equilibria for networks with malicious users
• An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design games
• A note on a parameter relating traffic equilibria and system optimal routing

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 Q4471277)