Show simple item record

dc.contributor.authorStoll, Alexander 19:34:39 (GMT) 19:34:39 (GMT)
dc.description.abstractIn games where selfish players compete for resources, they often arrive at equilibria that are less desirable than the social optimum. To combat this inefficiency, it is common for some central authority to place tolls on the resources in order to guide these players to a more advantageous result. In this thesis, we consider the question of how to add tolls to atomic unsplittable congestion games in order to enforce a specific flow as the unique equilibrium. We consider this question in the context of both routing games and matroid congestion games. In the former case, we show that for the class of series-parallel graphs the nonatomic tolls suffice, and investigate examples for which nonatomic tolls fail. In the latter case, we show that the nonatomic tolls can also be used to impose flows in atomic laminar matroid games.en
dc.publisherUniversity of Waterlooen
dc.subjectNash equilibriumen
dc.subjectlatency functionen
dc.subjectcongestion gameen
dc.subjectmatroid congestion gameen
dc.subjectnetwork routing gameen
dc.subject.lcshGame theoryen
dc.subject.lcshGames of strategy (Mathematics)en
dc.titleTolls For Atomic Congestion Gamesen
dc.typeMaster Thesisen
dc.pendingfalse and Optimizationen and Optimizationen of Waterlooen
uws-etd.degreeMaster of Mathematicsen
uws.contributor.advisorSwamy, Chaitanya
uws.contributor.affiliation1Faculty of Mathematicsen

Files in this item


This item appears in the following Collection(s)

Show simple item record


University of Waterloo Library
200 University Avenue West
Waterloo, Ontario, Canada N2L 3G1
519 888 4883

All items in UWSpace are protected by copyright, with all rights reserved.

DSpace software

Service outages