Fair and Distributed Dynamic Optimal Transport for Resource Allocation over Networks

Optimal transport is a framework that facilitates the most efficient allocation of a limited amount of resources. However, the most efficient allocation scheme does not necessarily preserve the most fairness. In this paper, we establish a framework which explicitly considers the fairness of dynamic...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2021 55th Annual Conference on Information Sciences and Systems (CISS) s. 1 - 6
Hlavní autoři: Hughes, Jason, Chen, Juntao
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 24.03.2021
Témata:
Convergence
Distributed algorithms
Dynamic scheduling
Heuristic algorithms
Receivers
Resource management
Trajectory
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Optimal transport is a framework that facilitates the most efficient allocation of a limited amount of resources. However, the most efficient allocation scheme does not necessarily preserve the most fairness. In this paper, we establish a framework which explicitly considers the fairness of dynamic resource allocation over a network with heterogeneous participants. As computing the transport strategy in a centralized fashion requires significant computational resources, it is imperative to develop computationally light algorithm that can be applied to large scale problems. To this end, we develop a fully distributed algorithm for fair and dynamic optimal transport with provable convergence using alternating method of multipliers. In the designed algorithm, each corresponding pair of resource supplier and receiver compute their own solutions and update the transport schemes through negotiation iteratively which do not require a central planner. The distributed algorithm can yield a fair and efficient resource allocation mechanism over a network. We corroborate the obtained results through case studies.
AbstractList Optimal transport is a framework that facilitates the most efficient allocation of a limited amount of resources. However, the most efficient allocation scheme does not necessarily preserve the most fairness. In this paper, we establish a framework which explicitly considers the fairness of dynamic resource allocation over a network with heterogeneous participants. As computing the transport strategy in a centralized fashion requires significant computational resources, it is imperative to develop computationally light algorithm that can be applied to large scale problems. To this end, we develop a fully distributed algorithm for fair and dynamic optimal transport with provable convergence using alternating method of multipliers. In the designed algorithm, each corresponding pair of resource supplier and receiver compute their own solutions and update the transport schemes through negotiation iteratively which do not require a central planner. The distributed algorithm can yield a fair and efficient resource allocation mechanism over a network. We corroborate the obtained results through case studies.
Author Hughes, Jason
Chen, Juntao
Author_xml – sequence: 1
  givenname: Jason
  surname: Hughes
  fullname: Hughes, Jason
  email: jhughes50@fordham.edu
  organization: Fordham University,Department of Computer and Information Science,New York,NY,USA,10023
– sequence: 2
  givenname: Juntao
  surname: Chen
  fullname: Chen, Juntao
  email: jchen504@fordham.edu
  organization: Fordham University,Department of Computer and Information Science,New York,NY,USA,10023
BookMark eNotj99KwzAchSPohZs-gSB5gdb8a5pcjup0MBy4ej2S9hcIdklJM2Vvb2G7Oue7OXxngW5DDIDQMyUlpUS_NJv9viJa1SUjjJZaEMK4vEELKmUlKJOK3aN2bXzCJvT41U85eXvKMPdzMEff4d2Y_dEMuE0mTGNMGbuY8BdM8ZQ6wKthiJ3JPgYcfyHhT8h_Mf1MD-jOmWGCx2su0ff6rW0-iu3ufdOstoVnhOdCMiW0sboSzilwVV0DsbUFYJpRZvoZtKw4s1T1XPTa9dRQAlYSpzrKBF-ip8uuB4DDmGbXdD5cj_J_SqJOkw
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CISS50987.2021.9400236
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1665412682
9781665412681
EndPage 6
ExternalDocumentID 9400236
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i203t-62849ab954ff8ef577e0b7bee29212ad0b796532b18d34d9fd1a10eb60f8c1243
IEDL.DBID RIE
ISICitedReferencesCount 5
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000671822600028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Thu Jun 29 18:39:02 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i203t-62849ab954ff8ef577e0b7bee29212ad0b796532b18d34d9fd1a10eb60f8c1243
PageCount 6
ParticipantIDs ieee_primary_9400236
PublicationCentury 2000
PublicationDate 2021-March-24
PublicationDateYYYYMMDD 2021-03-24
PublicationDate_xml – month: 03
  year: 2021
  text: 2021-March-24
  day: 24
PublicationDecade 2020
PublicationTitle 2021 55th Annual Conference on Information Sciences and Systems (CISS)
PublicationTitleAbbrev CISS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8825417
Snippet Optimal transport is a framework that facilitates the most efficient allocation of a limited amount of resources. However, the most efficient allocation scheme...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Convergence
Distributed algorithms
Dynamic scheduling
Heuristic algorithms
Receivers
Resource management
Trajectory
Title Fair and Distributed Dynamic Optimal Transport for Resource Allocation over Networks
URI https://ieeexplore.ieee.org/document/9400236
WOSCitedRecordID wos000671822600028&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5t8eBJpRXf5ODRbbNJdpMcpVr0Ugut0FtJshMo1Fb6-v1OdteK4MVbEgKBGZJvZjIzHyH3TjsWBPjEp-iiSGkA38FMJs5Z4y2aJDK4kmxCDYd6OjWjBnk41MIAQJl8Bt04LP_yi5XfxVBZL5J4c5E3SVOpvKrVqot-U2Z6_dfxGOFPK_T6eNqtN_9iTSlBY3Dyv-NOSeen-o6ODrhyRhqwbJPJwM7XFN1--hRb3UaWKsBxxSdP3_Dif9gFPbQqp2iL0u_QPH1cRMiKKqAxY5MOq9zvTYe8D54n_ZekZkRI5pyJbZIjmBjrTCZD0BAypYA55QC4QQiyBU5MngnuUl0IWZhQpDZl4HIWtEckF-ektVwt4YJQi7aDYzp4pZw0vEDHyeXCSwa-MCKoS9KOEpl9Vk0vZrUwrv5evibHUegxOYvLG9LarndwS478fjvfrO9KTX0BFDuXjw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61CnpSacW3OXh02-wmu9kcpVparGuhFXorSXYChT6kD3-_k-1aEbx4S0IgMEPyzUxm5iPk3qSGOQ42sCG6KEIowHcwFoExWlmNJolwpiCbkFmWjkaqXyEPu1oYACiSz6Dhh8Vffr6wGx8qa3oS74gne2TfM2eV1Vpl2W_IVLPVHQwQAFOJfl8UNsrtv3hTCthoH__vwBNS_6m_o_0dspySCsxrZNjWkyVFx58--Wa3nqcKcLxllKdvePVnekp3zcopWqP0OzhPH6cetLwSqM_ZpNk2-3tVJ-_t52GrE5ScCMEkYnwdJAgnShsVC-dScLGUwIw0AJFCENI5TlQS88iEac5Frlwe6pCBSZhLLWI5PyPV-WIO54RqtB4MS52V0ggV5eg6mYRbwcDmijt5QWpeIuOPbduLcSmMy7-X78hhZ_jaG_e62csVOfIK8Klakbgm1fVyAzfkwH6uJ6vlbaG1LyiSmtg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2021+55th+Annual+Conference+on+Information+Sciences+and+Systems+%28CISS%29&rft.atitle=Fair+and+Distributed+Dynamic+Optimal+Transport+for+Resource+Allocation+over+Networks&rft.au=Hughes%2C+Jason&rft.au=Chen%2C+Juntao&rft.date=2021-03-24&rft.pub=IEEE&rft.spage=1&rft.epage=6&rft_id=info:doi/10.1109%2FCISS50987.2021.9400236&rft.externalDocID=9400236