Distributed Mismatch Tracking Algorithm for Constraint-Coupled Resource Allocation: Optimality and Differential Privacy

This paper considers constraint-coupled distributed resource allocation problems (DRAPs), where each agent holds a private cost function and obtains the solution via only local communication. In this paper, we propose a novel distributed algorithm (termed DMAC) to achieve optimality for DRAPs based...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE transactions on automatic control s. 1 - 15
Hlavní autori: Wu, Wenwen, Zhu, Shanying, Liu, Shuai, Guan, Xinping
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 2025
Predmet:
ISSN:0018-9286, 1558-2523
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract This paper considers constraint-coupled distributed resource allocation problems (DRAPs), where each agent holds a private cost function and obtains the solution via only local communication. In this paper, we propose a novel distributed algorithm (termed DMAC) to achieve optimality for DRAPs based on mismatch tracking scheme. We show that the proposed algorithm converges at a sublinear rate for strongly convex cost functions and a linear convergence rate for smooth and strongly convex cost functions, respectively. With privacy concerns, the exchanged information is masked with independent Laplace noise against potential attackers with access to even all network communication. We further propose a differentially private version (termed diff-DMAC) to achieve cost-optimal distribution of resources while preserving privacy. Adopting constant stepsizes, the linear convergence property of diff-DMAC in mean square is established. Moreover, it is proven that the algorithm is differentially private. We also characterize and improve the trade-off between convergence accuracy and privacy level. Finally, a numerical example is provided for verification.
AbstractList This paper considers constraint-coupled distributed resource allocation problems (DRAPs), where each agent holds a private cost function and obtains the solution via only local communication. In this paper, we propose a novel distributed algorithm (termed DMAC) to achieve optimality for DRAPs based on mismatch tracking scheme. We show that the proposed algorithm converges at a sublinear rate for strongly convex cost functions and a linear convergence rate for smooth and strongly convex cost functions, respectively. With privacy concerns, the exchanged information is masked with independent Laplace noise against potential attackers with access to even all network communication. We further propose a differentially private version (termed diff-DMAC) to achieve cost-optimal distribution of resources while preserving privacy. Adopting constant stepsizes, the linear convergence property of diff-DMAC in mean square is established. Moreover, it is proven that the algorithm is differentially private. We also characterize and improve the trade-off between convergence accuracy and privacy level. Finally, a numerical example is provided for verification.
Author Zhu, Shanying
Guan, Xinping
Liu, Shuai
Wu, Wenwen
Author_xml – sequence: 1
  givenname: Wenwen
  surname: Wu
  fullname: Wu, Wenwen
  email: wuwenwen@sjtu.edu.cn
  organization: School of Automation and Intelligent Sensing, Shanghai Jiao Tong University, Shanghai, China
– sequence: 2
  givenname: Shanying
  surname: Zhu
  fullname: Zhu, Shanying
  email: shyingzhu@gmail.com
  organization: School of Automation and Intelligent Sensing, Shanghai Jiao Tong University, Shanghai, China
– sequence: 3
  givenname: Shuai
  surname: Liu
  fullname: Liu, Shuai
  email: LIUS0025@ntu.edu.sg
  organization: School of Control Science and Engineering, Shandong University, Jinan, China
– sequence: 4
  givenname: Xinping
  surname: Guan
  fullname: Guan, Xinping
  email: xpguan@sjtu.edu.cn
  organization: School of Automation and Intelligent Sensing, Shanghai Jiao Tong University, Shanghai, China
BookMark eNpFkMtKAzEUhoNUsK3uXbjIC0zNZa7uyngFpSJ1PeRypo1Ok5KkSt_elBZcHX7O9x8O3wSNrLOA0DUlM0pJc7uctzNGWDHjJaVFw87QmBZFnbGC8REaE0LrrGF1eYEmIXylWOY5HaPfexOiN3IXQeM3EzYiqjVeeqG-jV3h-bBy3sT1BvfO49bZBAtjY9a63XZIlQ8IbucVJHJwSkTj7B1ebKPZiMHEPRZW43vT9-DBRiMG_O7Nj1D7S3TeiyHA1WlO0efjw7J9zl4XTy_t_DVTlOcxg0ZKWWrBq7yRFIAL0EVflbWWBCpd54oyRUVVciYlYVVd5b2mjRS6goKznk8ROd5V3oXgoe-2Pv3m9x0l3UFcl8R1B3HdSVyq3BwrBgD-cUrLJk_rP2n4bxI
CODEN IETAA9
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TAC.2025.3611592
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005-present
IEEE All-Society Periodicals Package (ASPP) 1998-Present
IEEE Xplore Digital Libary (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-2523
EndPage 15
ExternalDocumentID 10_1109_TAC_2025_3611592
11169492
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
6IK
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AGQYO
AHBIQ
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
F5P
HZ~
IFIPE
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
~02
3EH
5VS
AAYXX
AETIX
AGSQL
AI.
AIBXA
ALLEH
CITATION
EJD
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFJZH
VH1
VJK
ID FETCH-LOGICAL-c134t-e9bbb6da3749b1ee3aed5f768db0e7d84c12c1a7632bb027874fd19bad7e532f3
IEDL.DBID RIE
ISSN 0018-9286
IngestDate Sat Nov 29 07:28:32 EST 2025
Wed Oct 01 07:05:17 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c134t-e9bbb6da3749b1ee3aed5f768db0e7d84c12c1a7632bb027874fd19bad7e532f3
PageCount 15
ParticipantIDs crossref_primary_10_1109_TAC_2025_3611592
ieee_primary_11169492
PublicationCentury 2000
PublicationDate 2025-00-00
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 2025-00-00
PublicationDecade 2020
PublicationTitle IEEE transactions on automatic control
PublicationTitleAbbrev TAC
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0016441
Score 2.4689493
Snippet This paper considers constraint-coupled distributed resource allocation problems (DRAPs), where each agent holds a private cost function and obtains the...
SourceID crossref
ieee
SourceType Index Database
Publisher
StartPage 1
SubjectTerms Differential privacy
distributed optimization
multi-agent systems
optimization algorithms
Title Distributed Mismatch Tracking Algorithm for Constraint-Coupled Resource Allocation: Optimality and Differential Privacy
URI https://ieeexplore.ieee.org/document/11169492
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2523
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0016441
  issn: 0018-9286
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYAMcDAG_GWBxaGlCR24pqtakEsPAaQ2CLbd4FKfalNQfx7zk54DQxsUeSTorv4vnvY9zF22lbSoMA4ghwgkpmDSMeYRaVIkNxf4ilGAtmEur1tPz3p--ayergLg4jh8Bm2_GPo5cPYzX2p7Jz2Za6lJo-7qJSqL2t9tQw8sNdul3Zw2v7qScb6_KHTpUwwzVoipwBIp78w6AepSsCUq_V_fs0GW2uCR96prb3JFnC0xVZ_jBTcZm89PwnXk1gh8Jv-jAJS98IJkZyvifPO4Hk87VcvQ07BKvdsnYEjooq64_lkQCKf5Xxa6WHOm-2C35FfGYaAnZsR8F5DqkLOYcDvp_1X49532OPV5UP3OmrIFSKXCFlFqK21ORihpLYJojAIWUnJB9gYFbSlS1KXGHI_qbW-PalkCYm2BhRmIi3FLlsajUe4x3iGUjhDGEjiUpXSAgLELlNo8hTKfJ-dfaq7mNQzNIqQe8S6INMU3jRFY5p9tuM1_b2uUfLBH-8P2YoXr4siR2ypms7xmC2716o_m56EP-QDIeG8zg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV07T8MwELYQIAEDb0R5emBhCCSxk9RsVQGBgMJQJLbI9l2gUmlRSYv495yd8BoY2KLIjqK7-L575O5j7KCZSY0CwwBSgEAmFgIVYhIUIkIyf5GjGPFkE1mn03x4UHd1s7rvhUFE__MZHrlLX8uHoR27VNkxnctUSUUWdyaRMo6qdq2vooGD9srw0hmOm19VyVAdd1ttigXj5Eik5AKp-BcK_aBV8ahyvvTP91lmi7X7yFuVvlfYFA5W2cKPoYJr7O3UzcJ1NFYI_Kb3Si6pfeKESdZlxXmr_zgc9cqnZ07uKnd8nZ4logzaw_FLn7Z8JvRppQM6p7gTfkuW5dm77FwPgJ_WtCpkHvr8btSbaPu-zu7Pz7rti6CmVwhsJGQZoDLGpKBFJpWJEIVGSAoKP8CEmEFT2ii2kSYDFBvjCpSZLCBSRkOGiYgLscGmB8MBbjKeoBRWEwrSdpkV0gAChDbJUKcxFGmDHX6KO3-ppmjkPvoIVU6qyZ1q8lo1DbbuJP29rhby1h_399ncRffmOr--7Fxts3n3qCpFssOmy9EYd9msnZS919Ge_1o-ABzdwBU
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%3Ajournal&rft.genre=article&rft.atitle=Distributed+Mismatch+Tracking+Algorithm+for+Constraint-Coupled+Resource+Allocation%3A+Optimality+and+Differential+Privacy&rft.jtitle=IEEE+transactions+on+automatic+control&rft.au=Wu%2C+Wenwen&rft.au=Zhu%2C+Shanying&rft.au=Liu%2C+Shuai&rft.au=Guan%2C+Xinping&rft.date=2025&rft.issn=0018-9286&rft.eissn=1558-2523&rft.spage=1&rft.epage=15&rft_id=info:doi/10.1109%2FTAC.2025.3611592&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_TAC_2025_3611592
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9286&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9286&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9286&client=summon