Jong, Remco de (2023) Equilibria in network congestion games. Bachelor's Thesis, Applied Mathematics.
|
Text
bAppM_2023_deJongR.pdf Download (1MB) | Preview |
|
![[img]](https://fse.studenttheses.ub.rug.nl/style/images/fileicons/text.png) |
Text
toestemming.pdf Restricted to Registered users only Download (129kB) |
Abstract
Network congestion games are a class of games that have been extensively studied from both a game theoretic and mathematical point of view. We develop a mathematical basis for analysing non-atomic instances of network congestion games, with attention to the proofs behind basic concepts. We furthermore establish an upper bound on the inefficiency of selfish equilibria. Having investigated the mathematical theory for this class of games, we analyse a standard numerical method to compute equilibrium flows. A conjugate based extension is discussed to remedy slow convergence. The methods are compared by analysis on a model of the city of Groningen.
| Item Type: | Thesis (Bachelor's Thesis) |
|---|---|
| Supervisor name: | Peypouquet, J.G. and Trenn, S. |
| Degree programme: | Applied Mathematics |
| Thesis type: | Bachelor's Thesis |
| Language: | English |
| Date Deposited: | 07 Aug 2023 09:06 |
| Last Modified: | 07 Aug 2023 09:06 |
| URI: | https://fse.studenttheses.ub.rug.nl/id/eprint/30908 |
Actions (login required)
 |
View Item |