We consider the problem of minimizing social cost in atomic congestion games and show,
perhaps surprisingly, that efficiently computed taxation mechanisms yield the same …

We consider a discrete-time dynamic search game in which a number of players compete to
find an invisible object that is moving according to a time-varying Markov chain. We examine …

The Power of Traffic Tolls The paper “In Congestion Games, Taxes Achieve Optimal
Approximation” by Paccagnan and Gairing investigates the power and limitations of taxes as …

With each separable optimization problem over a given set of vectors is associated its
multichoice counterpart which involves choosing n rather than one solutions from the set so …

We are tackling the problem of reducing high congestion in networks from a mathematical
point of view. First, we consider resource allocation problems where a set of commodities …

This dissertation examines four optimisation problems. The first chapter examines the
optimisation of network usage to prevent traffic congestion and internet data issues. The …