Atomic splittable flow over time games

DOI10.4230/LIPICS.SAND.2022.4MaRDI QIDQ7395539zbMATH OpenFDO

Authors Antonia Adamik, Leon Sering

Publication date 2022

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAND.2022.4

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Games involving graphs (91A43)

Cites work

• A Stackelberg strategy for routing flow over time
• Algorithms for the Network Oligopoly Problem
• An introduction to network flows over time
• Competitive routing in networks with polynomial costs
• Complexity and Parametric Computation of Equilibria in Atomic Splittable Congestion Games via Weighted Block Laplacians
• Constructing maximal dynamic flows from static flows
• Dynamic equilibria in fluid queueing networks
• Dynamic equilibria in time-varying networks
• Dynamic flows with adaptive route choice
• Efficient continuous-time dynamic network flow algorithms
• Equilibrium computation in atomic splittable singleton congestion games
• Existence and Uniqueness of Equilibria for Flows over Time
• Existence and Uniqueness of Equilibrium Points for Concave N-Person Games
• How bad is selfish routing?
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• Local smoothness and the price of anarchy in splittable congestion games
• Maximal, Lexicographic, and Dynamic Network Flows
• Multi-source multi-sink Nash flows over time
• Nash equilibria and the price of anarchy for flows over time
• Nash flows over time
• Nash flows over time with spillback
• Oligopolistic competitive packet routing
• On the relationship between Nash—Cournot and Wardrop equilibria
• On the uniqueness of equilibrium in atomic splittable routing games
• Open Problems in Throughput Scheduling
• Queueing dynamics and maximal throughput scheduling in switched processing systems
• Selfish routing with atomic players
• Stackelberg strategies and collusion in network games with splittable flow
• Technical Note—Traffic Equilibrium Paradoxes
• The impact of oligopolistic competition in networks
• The impact of spillback on the price of anarchy for flows over time
• The price of anarchy for instantaneous dynamic equilibria
• The quickest flow problem
• Transient flows in networks
• Uniqueness of equilibria in atomic splittable polymatroid congestion games

This page was built for publication: Atomic splittable flow over time games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7395539)