How hard is for agents to learn the user equilibrium? Characterizing traffic networks by means of entropy (Q6497536): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3409969 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Automata, Languages and Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Random planar graphs and the London street network / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: \({\mathcal Q}\)-learning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4411128 / rank | |||
Normal rank | |||
Latest revision as of 14:18, 3 December 2024
scientific article; zbMATH DE number 7843126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How hard is for agents to learn the user equilibrium? Characterizing traffic networks by means of entropy |
scientific article; zbMATH DE number 7843126 |
Statements
How hard is for agents to learn the user equilibrium? Characterizing traffic networks by means of entropy (English)
0 references
6 May 2024
0 references
traffic assignment
0 references
multiagent reinforcement learning
0 references
entropy
0 references
