SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Avoiding paradoxes in routing games · Study

ChapterShelves

ChapterAvoiding paradoxes in routing games

Eitan Altman2001

Chapter2001

Avoiding paradoxes in routing games

Eitan Altman · Rachid El-Azouzi · Odile Pourtallier

9 citations·0/0 files stored·Teletraffic science and engineering

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Transportation Planning and Optimization Network Traffic and Congestion Control Game Theory and Applications

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 9 citations exist upstream.

References

1968Über ein Paradoxon aus der Verkehrsplanung 1993Competitive routing in multiuser communication networks 1995Architecting noncooperative networks 1990A paradox of congestion in a queuing network 1984On some traffic equilibrium theory paradoxes 1997Capacity allocation under noncooperative routing 2000Braess-like paradoxes in distributed computer systems 1997Braess's paradox in a loss network

Cited by

2004Properties of equilibria in competitive routing with several user types

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2003Avoiding paradoxes in multi-agent competitive routingarticle · 9 shared references 2004Properties of equilibria in competitive routing with several user typesother · 8 shared references 2023Bibliometric analysis and systematic literature review of the traffic paradoxes (1968–2022)review · 6 shared references 2002Non-cooperative routing in loss networksarticle · 5 shared references 2000Braess-like paradoxes in distributed computer systemsarticle · 4 shared references 2007Topological Uniqueness of the Nash Equilibrium for Selfish Routing with Atomic Usersarticle · 4 shared references

Details

Year2001

Typechapter

Published2001-01-01

VenueTeletraffic science and engineering

ISSN-L1388-3437

Languageen

Citations9

Files0 public / 0

ShelfTransportation Planning and Optimization

Identifiers

doi10.1016/s1388-3437(01)80158-x

openalex_workW1530295019

Links

Imported from OpenAlex (CC0) — nothing here is generated.