Resource Allocation In A Fair Manner

PhD Thesis Proposal Defence


Title: "Resource Allocation In A Fair Manner"

by

Mr. Yuchen MAO


Abstract:

Resources allocation problem is a fundamental problem in combinatorial 
optimization. It has many applications in practice such as to memory 
allocation, job scheduling, and on-line advertising.

In this proposal, we focus on a classic type of such problems, the restricted 
max-min fair allocation problem. We present a (6 + δ)-approximation algorithm
for this problem, where δ is an arbitrarily small constant. This improves the
previous best approximation ratio of 6 + 2 √10 + δ ≈ 12.3 + δ. At the end of
the proposal, we investigate a few other resource allocation problems that can
be worked on in the future.


Date:			Thursday, 30 August 2018

Time:                  	3:00pm - 5:00pm

Venue:                  Room 3494
                        (lifts 25/26)

Committee Members:	Prof. Siu-Wing Cheng (Supervisor)
 			Dr. Sunil Arya (Chairperson)
 			Prof. Mordecai Golin
 			Dr. Ke Yi


**** ALL are Welcome ****