Efficient graph topologies in network routing games (Q1021587): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.geb.2008.04.011 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1989972248 / rank | |||
Normal rank | |||
Revision as of 21:50, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient graph topologies in network routing games |
scientific article |
Statements
Efficient graph topologies in network routing games (English)
0 references
8 June 2009
0 references
network routing games
0 references
congestion games
0 references
price of anarchy
0 references
