Braess's Paradox in large random graphs (Q3061184): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1002/rsa.20325 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4245653884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding paradoxes in multi-agent competitive routing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic assignment problem for a general network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Braess paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity allocation under noncooperative routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding the Braess paradox in non-cooperative networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the severity of Braess's paradox: designing networks for selfish users is hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK / rank
 
Normal rank

Latest revision as of 14:16, 3 July 2024

scientific article
Language Label Description Also known as
English
Braess's Paradox in large random graphs
scientific article

    Statements