Master Thesis Defense - June 2, 2017: Distributed Allocation of Subsidized Goods in an Efficient and Private Approach

Hamid Reza Nabati Yazdi Zadeh

Friday, June 2, 2017 at 11:00 a.m.
Room EV002.260

You are invited to attend the following M.A.Sc. (Quality Systems Engineering) thesis examination.

Examining Committee

Dr. A. Awasthi, Chair
Dr. J. Yu, Supervisor
Dr. C. Wang, CIISE Examiner
Dr. I. Contreras, External Examiner (MIE)

Abstract

Efficient resource allocation in large-scale networks is challenging when users' privacy is important. Distributed resource allocation approach has recently been applied extensively to design an efficient algorithm to share common resource between users in a private and independent procedure. In this work, we study the efficiency of AIMD distributed resource allocation algorithm in large-scale networks. We first formulate resource allocation problem as a class of network utility maximization (NUM) using the concept of utility functions. We apply AIMD algorithm for networks with concave strictly increasing utility function and then expand it to non-increasing and quasi-concave utility functions. We also model resource allocation problem as a competition game to evaluate the efficiency properties of unique equilibrium when network parameters change. To illustrate the effectiveness of the proposed solutions, we present simulation results for a public renewable-energy powered charging station network in which the electric vehicles (EV) compete to be recharged.