This paper considers the decentralized (discrete) optimal transport (D-OT)
problem. In this setting, a network of agents seeks to design a transportation
plan jointly, where the cost function is the sum of privately held costs for
each agent. We reformulate the D-OT problem as a constraint-coupled
optimization problem and propose a single-loop decentralized