Bounding Residence Times for Atomic Dynamic Routings (Q5870375): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/moor.2021.1242 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4213091691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Bufferless Packet Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Direct routing: Algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Dynamic Flow Games: Adaptive vs. Nonadaptive Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Packet Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Equilibria in Fluid Queueing Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long term behavior of dynamic equilibria in fluid queuing networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quickest Flows Over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy for instantaneous dynamic equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flows over time: Efficient algorithms and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive routing over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Quickest Transshipment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Equilibria and the Price of Anarchy for Flows over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash equilibria and the price of anarchy for flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-Time Message Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods for message routing in parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess's paradox for flows over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Packet Scheduling on Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527032 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet Routing: Complexity and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Atomic Congestion Games with Seasonal Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nash Flows Over Time with Spillback / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria / rank
 
Normal rank

Latest revision as of 06:08, 31 July 2024

scientific article; zbMATH DE number 7639669
Language Label Description Also known as
English
Bounding Residence Times for Atomic Dynamic Routings
scientific article; zbMATH DE number 7639669

    Statements

    Bounding Residence Times for Atomic Dynamic Routings (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2023
    0 references
    atomic dynamic routing
    0 references
    residence time
    0 references
    token technique
    0 references
    selfish routing
    0 references
    Nash equilibrium
    0 references
    0 references
    0 references

    Identifiers