An extended reinforcement algorithm for estimation of human behaviour in congestion games
Year of publication: |
2004
|
---|---|
Other Persons: | Chmura, Thorsten (contributor) ; Pitz, Thomas (contributor) |
Publisher: |
Bonn : Graduate School of Economics |
Subject: | Engpass | Bottleneck | Spieltheorie | Game theory | Nash-Gleichgewicht | Nash equilibrium | Algorithmus | Algorithm |
Extent: | Online-Ressource, 19 p., text |
---|---|
Series: | Bonn Econ Discussion Papers / BGSE. - Bonn : Univ., ZDB-ID 2124986-6. - Vol. 2004,24 |
Type of publication: | Book / Working Paper |
Type of publication (narrower categories): | Arbeitspapier ; Working Paper |
Language: | English |
Notes: | Systemvoraussetzungen: Acrobat reader |
Source: | ECONIS - Online Catalogue of the ZBW |
-
A logarithmic approximation for polymatroid congestion games
Harks, Tobias, (2016)
-
How hard is it to find extreme Nash equilibria in network congestion games?
Gassner, Elisabeth, (2008)
-
Does congestion always hurt? : managing discount under congestion in a game-theoretic setting
Saha, Rajib Lochan, (2021)
- More ...
-
Experiments and Simulations on Day-to-Day Route Choice-Behaviour
Selten, Reinhard, (2002)
-
Minority Game: Experiments and Simulations of Traffic Scenarios
Chmura, Thorsten, (2004)
-
An Extended Reinforcement Algorithm for Estimation of Human Behaviour in Congestion Games
Chmura, Thorsten, (2004)
- More ...