A distributed cutting-plane algorithm that uses alternating projections and secure multiparty summation to solve nonconvex resource allocation problems without revealing agents' private constraints or profiles.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A Privacy-preserving Method to Optimize Distributed Resource Allocation
A distributed cutting-plane algorithm that uses alternating projections and secure multiparty summation to solve nonconvex resource allocation problems without revealing agents' private constraints or profiles.