Nash equilibria and the price of anarchy for flows over time (Q647485): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CONTRAM / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-010-9299-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106700782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Dynamic Traffic Equilibrium Assignment with Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equilibria in Dynamic Selfish Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of dynamic network flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4811393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Link travel times. I: Desirable properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Link travel times. II: Properties derived from traffic-flow models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue Spillovers in Transportation Networks with a Route Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient continuous-time dynamic network flow algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Network Traffic Assignment Considered as a Continuous Time Optimal Control Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive routing over time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Some Equivalent Objectives for Dynamic Network Flow Problems / 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: Flows over Time with Load-Dependent Transit Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: System optimal and user equilibrium time-dependent traffic assignment in congested networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342505 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Class of Instantaneous Dynamic User-Optimal Traffic Assignment Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Network Flows over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in the Continuous Dynamic Network Loading Problem / rank
 
Normal rank

Latest revision as of 16:55, 4 July 2024

scientific article
Language Label Description Also known as
English
Nash equilibria and the price of anarchy for flows over time
scientific article

    Statements

    Nash equilibria and the price of anarchy for flows over time (English)
    0 references
    0 references
    0 references
    23 November 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    flow over time
    0 references
    Nash equilibrium
    0 references
    routing game
    0 references
    deterministic queuing model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references