Login | Register

Distributed, Private, and Derandomized Allocation of Subsidized Goods


Distributed, Private, and Derandomized Allocation of Subsidized Goods

Nabati Yazdi Zadeh, Hamid Reza (2017) Distributed, Private, and Derandomized Allocation of Subsidized Goods. Masters thesis, Concordia University.

[thumbnail of NabatiYazdiZadeh_MASc_S2017.pdf]
Text (application/pdf)
NabatiYazdiZadeh_MASc_S2017.pdf - Accepted Version


Efficient resource allocation is challenging when privacy of users is important. Distributed solution approaches have recently been used extensively to find a solution for such problems. In this work, we study the efficiency of distributed AIMD algorithm for allocation of subsidized goods. To this end, we assign each user a suitable utility function describing the amount of satisfaction that it has from allocated resource. We define the resource allocation as a \emph{total utilitarianism} problem that is an optimization problem of sum of users utility functions subjected to capacity constraint. Recently, a stochastic state-dependent variant of AIMD algorithm is used for allocation of common goods among users with strictly increasing and concave utility functions. We improve this algorithm to allocate subsidized goods to users with concave and nonmonotonous utility functions as well as users with quasi-concave utility functions. We also derandomize the AIMD algorithm and compare its efficiency with the stochastic version. We then 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 in which the electric vehicles (EV) compete to be recharged.

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Concordia Institute for Information Systems Engineering
Item Type:Thesis (Masters)
Authors:Nabati Yazdi Zadeh, Hamid Reza
Institution:Concordia University
Degree Name:M.A. Sc.
Program:Quality Systems Engineering
Date:21 August 2017
Thesis Supervisor(s):Yuan Yu, Jia
Keywords:Distributed Resource Allocation, Total Utilitarianism, AIMD Algorithm, Game Theory, Electric Vehicle (EV) Charging
ID Code:982832
Deposited On:17 Nov 2017 16:24
Last Modified:01 Jun 2018 00:00
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top