LIDS Tea: Coding Schemes For Limited Communication in Decentralized Resource Allocation

Wednesday, March 30, 2016 - 4:10pm

Event Calendar Category

Other LIDS Events

Speaker Name

Chinwendu Enyioha

Affiliation

Postdoctoral Research Fellow at Harvard University

Building and Room number

LIDS 6th floor lounge (Bldg 32, Dreyfoos Tower)

Abstract

Efficiently coordinating power allocation in massive power systems, especially in a decentralized way, involves enormous communication between providers and users. Given communication constraints, a critical question to ask is - how can decentralized resource allocation strategies be implemented using limited communication? In this talk, I will present a decentralized power allocation algorithm using one-way communication in which suppliers broadcast a coordinating (price) signal using one bit per iteration and users consume power without relaying their anticipated demand to the supplier. In addition to providing conditions under which users’ demand does not exceed suppliers’ capacity (primal feasibility), I will present practical coding schemes, called PF-codes (Primal-Feasible codes), for the one-bit communication that prevents a system overload. Further, I will show that the PF-codes asymptotically converge to the true primal/dual optimal solution, and present simulations demonstrating accuracy of our theoretical analyses.

About LIDS Tea: LIDS Tea talks are 20 minute long informal presentations for the purpose of sharing ideas and making others aware about some of the topics that may be of interest to the LIDS audience. If you are interested in presenting in the upcoming seminars, please email Marzieh Parandehgheibi or Yasin Yazicioglu.