Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.647971
Title: Price of anarchy for congestion games with stochastic demands
Author: Wang, Chenlan
ISNI:       0000 0004 5348 1944
Awarding Body: University of Warwick
Current Institution: University of Warwick
Date of Award: 2014
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract:
The price of anarchy is a game-theoretical concept and it measures system degradation caused by players' selfish behaviours. This thesis extends models of congestion games to take stochastic demands into account and studies the price of anarchy on the basis of generalised models developed in this research. In the presence of stochastic demands, the models developed in this study better re flect the reality of a transportation network. The study would help provide a theoretical foundation and insights into mechanism design of transportation games and traffic control in practice. This thesis is concerned with both non-atomic and atomic congestion games, which involve an infinite and finite number of travellers respectively. We introduce the notions of user equilibrium and system optimum under stochastic demands and investigate the behaviours of travellers and central coordinators in a stochastic environment. At a user equilibrium, travellers choose routes independently and aim to minimise their own expected travel costs, while at a system optimum, traffic is fully coordinated to minimise the expected total cost over the whole network. We extend two existing methods of bounding the price of anarchy and compute the quality upper bounds for polynomial cost functions and very general settings of demand distributions. More specifically, we consider positive-valued distributions and normal distributions for non-atomic congestion games, and positive-valued discrete distributions for atomic congestion games. Our results show that the price of anarchy depends on the class of cost functions, demand distributions and, to some extent, network topologies. All the upper bounds are tight in some special cases, including the case of deterministic demands. The two bounding methods are also compared.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.647971  DOI: Not available
Keywords: HE Transportation and Communications
Share: