pith. sign in

arxiv: 2605.23864 · v1 · pith:4T5VZ3XEnew · submitted 2026-05-22 · 🧮 math.OC · cs.SY· eess.SY

Harnessing Individual Motivation for Collective Efficiency: A Mechanism-Driven Distributed Optimization Method

Dongwei Xie , Xuhao Wang , Yujie Tang , Jie Song This is my paper

Pith reviewed 2026-05-25 03:39 UTC · model grok-4.3

classification 🧮 math.OC cs.SYeess.SY
keywords distributed optimizationincentive mechanismsshadow pricingVCG mechanismcoupled constraintsmulti-agent decision-makingcollective efficiency
0
0 comments X

The pith

Incentives make self-interested agents execute a distributed optimization algorithm for coupled problems and close a feedback loop with the results.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper proposes a method that uses specially designed incentives to induce rational participants to run steps of a distributed algorithm even when their local objectives conflict with the global one. The setting is optimization problems whose objective functions and constraints are coupled across agents, so that neither full centralization nor independent local solving works. The authors give a distributed algorithm with convergence guarantees and then introduce shadow pricing and Vickrey-Clarke-Groves mechanisms that reward truthful participation; the resulting payments are computed from the algorithm's output, which in turn depends on the agents following the mechanism. The two pieces therefore reinforce each other in an explicit closed loop. Numerical tests illustrate that the combination produces the desired collective solution under the stated conditions.

Core claim

For optimization problems with coupled objective functions and coupled constraints, a distributed algorithm can be paired with shadow pricing and Vickrey-Clarke-Groves incentive mechanisms so that rational agents voluntarily execute the algorithm steps; the mechanisms drive participation while the computed optimum determines the incentive payments, forming a closed loop that aligns individual self-interest with collective performance.

What carries the argument

The closed loop between the distributed optimization algorithm (with convergence guarantees) and the two incentive mechanisms, where mechanism payments motivate algorithm execution and algorithm outputs set the payment levels.

If this is right

  • The algorithm converges to the optimal solution of the coupled problem.
  • Rational agents prefer to participate under either the shadow pricing or the VCG mechanism.
  • The incentive payments and the algorithm outputs mutually determine each other without external coordination.
  • The approach applies directly to industrial multi-agent settings where local information cannot be centralized.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same loop structure could be tested in settings with time-varying couplings or asynchronous updates.
  • If the distributed enforcement of payments succeeds, the method could reduce reliance on a single trusted auctioneer in repeated resource-allocation problems.
  • One could check whether the convergence rate changes when agents have only approximate knowledge of others' cost functions.

Load-bearing premise

That the incentives can be calculated and enforced in a fully distributed manner without any trusted central party, and that rational self-interested agents will choose to follow the prescribed algorithm steps rather than deviate for private gain.

What would settle it

A simulation or deployment in which, after the incentive payments are announced, at least one rational agent obtains a strictly higher individual payoff by deviating from the algorithm steps instead of following them.

Figures

Figures reproduced from arXiv: 2605.23864 by Dongwei Xie, Jie Song, Xuhao Wang, Yujie Tang.

Figure 1
Figure 1. Figure 1: Transportation network in Example 3 If all suppliers use true local cost parameters, the optimal solution is x ∗ 1 = 13/6, x ∗ 2 = 5/3, x ∗ 3 = 7/6, and their respective benefits are |u ∗ 1 | = 9.38, |u ∗ 2 | = 5.56, |u ∗ 3 | = 2.72. However, if supplier 1 deliberately conceals its private cost parameter and instead uses a fake parameter c1 = (0.5, 0, 0, 0.5)T for distributed optimization, while the other … view at source ↗
Figure 2
Figure 2. Figure 2: Transportation network in different scale [PITH_FULL_IMAGE:figures/full_fig_p020_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Comparison of optimality gap performance [PITH_FULL_IMAGE:figures/full_fig_p020_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Comparison of constraint violation performance [PITH_FULL_IMAGE:figures/full_fig_p021_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: The impact of individual parameters misreporting on profit [PITH_FULL_IMAGE:figures/full_fig_p022_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: The impact of parameter misreporting portfolios on profit [PITH_FULL_IMAGE:figures/full_fig_p023_6.png] view at source ↗
Figure 2
Figure 2. Figure 2: The figures demonstrate that dimensionality reduction for the sub-optimization problems Si,k 26 [PITH_FULL_IMAGE:figures/full_fig_p053_2.png] view at source ↗
read the original abstract

In industrial scenarios involving multi-agent collective decision-making, centralized decision-making may not be admissible due to restrictive access to individual local information, while the conflicts between participants' self-interest and global performance may also impede collaborative distributed decision-making. This paper proposes a mechanism-driven distributed decision-making method, wherein incentives are employed and designed to motivate participants to collaborate in a distributed fashion even though each participant's decision is driven primarily by self-interest. Focusing on optimization problems with coupled objective functions and coupled constraints, we design a distributed optimization algorithm tailored for this class of problems and provide guarantees for its convergence. Furthermore, we design two incentive mechanisms, the shadow pricing mechanism and the Vickrey-Clarke-Groves mechanism, and demonstrate that participants are willing to engage in distributed collaboration under these mechanisms. The mechanism drives the execution of the distributed algorithm, and the optimal result of distributed computation guides the determination of incentives in the mechanism, both of which are interrelated to form a closed loop. Finally, numerical experiments illustrate the effectiveness of the proposed algorithm and mechanisms.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes a mechanism-driven distributed optimization method for multi-agent problems with coupled objectives and constraints. It designs a tailored distributed algorithm with claimed convergence guarantees, along with shadow pricing and Vickrey-Clarke-Groves (VCG) incentive mechanisms that motivate self-interested agents to participate. These elements form a closed loop in which the mechanisms drive algorithm execution and the optimization outcomes determine the incentives. Numerical experiments are used to illustrate effectiveness.

Significance. If the central claims hold—particularly that the mechanisms can be realized in a fully distributed fashion while preserving incentive compatibility and convergence—this would provide a concrete way to align individual rationality with collective optimality in settings where central coordination is inadmissible. The explicit closed-loop construction between incentives and distributed computation is a distinctive feature that could influence subsequent work on mechanism-augmented distributed optimization.

major comments (2)
  1. [Abstract and mechanism design sections] Abstract and VCG mechanism description: the assertion that the VCG mechanism operates in a fully distributed manner without a trusted central party is load-bearing for the closed-loop claim, yet the standard VCG payment p_i = w(N) - w(N_{-i}) requires solving the global welfare maximization both with and without agent i. In the presence of coupled constraints this step cannot be performed by local neighbor communication alone; it either demands central aggregation of all reports or full revelation of private cost functions, directly contradicting the 'fully distributed' premise.
  2. [Abstract] Abstract (convergence guarantees paragraph): the manuscript states that the distributed algorithm 'provide[s] guarantees for its convergence,' but supplies no derivation, error bounds, or proof sketch. Because the closed-loop argument relies on the algorithm reaching the optimum that then sets the incentives, the absence of analytic support for convergence is a load-bearing gap; numerical experiments alone do not substitute for the required guarantees.
minor comments (1)
  1. [Abstract] The interdependence between the mechanism and the algorithm is described as forming a 'closed loop,' but the timing or iterative resolution of this interdependence is not made explicit; a clarifying paragraph or diagram would remove potential ambiguity about whether the construction is well-defined or circular.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive comments, which help clarify the presentation of our mechanism-driven distributed optimization approach. We address the two major comments point by point below and will revise the manuscript accordingly.

read point-by-point responses

  1. Referee: [Abstract and mechanism design sections] Abstract and VCG mechanism description: the assertion that the VCG mechanism operates in a fully distributed manner without a trusted central party is load-bearing for the closed-loop claim, yet the standard VCG payment p_i = w(N) - w(N_{-i}) requires solving the global welfare maximization both with and without agent i. In the presence of coupled constraints this step cannot be performed by local neighbor communication alone; it either demands central aggregation of all reports or full revelation of private cost functions, directly contradicting the 'fully distributed' premise.

    Authors: We agree that realizing standard VCG payments in a fully distributed fashion with coupled constraints is nontrivial, as counterfactual welfare computations generally require either central coordination or additional information exchange. Our manuscript positions the VCG mechanism as one of two incentive designs to ensure participation, with the distributed algorithm handling the underlying optimization. In revision we will explicitly distinguish the fully distributed shadow-pricing mechanism from the VCG component, clarify any communication requirements for the latter, and either supply a privacy-preserving distributed procedure for the counterfactuals (leveraging repeated runs of the proposed algorithm) or acknowledge the limitation and de-emphasize VCG as the primary distributed incentive. This will make the closed-loop claims accurate without overstatement. revision: yes

  2. Referee: [Abstract] Abstract (convergence guarantees paragraph): the manuscript states that the distributed algorithm 'provide[s] guarantees for its convergence,' but supplies no derivation, error bounds, or proof sketch. Because the closed-loop argument relies on the algorithm reaching the optimum that then sets the incentives, the absence of analytic support for convergence is a load-bearing gap; numerical experiments alone do not substitute for the required guarantees.

    Authors: We acknowledge that the abstract asserts convergence guarantees without an accompanying derivation or proof sketch in the submitted version. The full analysis exists in the technical development but was not foregrounded. In the revision we will add an explicit proof sketch, state the key assumptions (e.g., convexity, communication topology), and include error bounds or convergence rates. This will directly support the closed-loop argument that the algorithm reaches the optimum used to set incentives. revision: yes

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper designs a distributed optimization algorithm for coupled problems with convergence guarantees, then introduces shadow pricing and VCG mechanisms whose payments are computed from the algorithm's output to incentivize participation, forming an intentional closed loop. This interdependence is a design feature rather than a self-definitional reduction where a derived quantity equals its input by construction. No equations are exhibited that tautologically rename a fitted parameter as a prediction, no load-bearing self-citation chain is invoked to justify uniqueness, and the central claims rest on standard primal-dual methods and mechanism-design results that remain independently verifiable. The analysis is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review provides no explicit free parameters, axioms, or invented entities; the central claims rest on unstated assumptions about agent rationality and the existence of distributed implementations of the incentive calculations.

pith-pipeline@v0.9.0 · 5717 in / 1315 out tokens · 38600 ms · 2026-05-25T03:39:50.198645+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

82 extracted references · 82 canonical work pages

  1. [1]

    Tracking-

    Falsone, Alessandro and Notarnicola, Ivano and Notarstefano, Giuseppe and Prandini, Maria , journal=. Tracking-. 2020 , publisher=

    work page 2020

  2. [2]

    IEEE Control Systems Magazine , volume=

    Tutorial on dynamic average consensus: The problem, its applications, and the algorithms , author=. IEEE Control Systems Magazine , volume=. 2019 , publisher=

    work page 2019

  3. [3]

    Bertsekas, Dimitri and Tsitsiklis, John , year=

    work page

  4. [4]

    IEEE Transactions on Industrial Informatics , volume=

    Efficient and privacy-enhanced federated learning for industrial artificial intelligence , author=. IEEE Transactions on Industrial Informatics , volume=. 2019 , publisher=

    work page 2019

  5. [5]

    Management Science , volume=

    The limits of incentives in economic matching procedures , author=. Management Science , volume=. 2021 , publisher=

    work page 2021

  6. [6]

    Nature Communications , volume=

    Break down the decentralization-security-privacy trilemma in management of distributed energy systems , author=. Nature Communications , volume=. 2024 , publisher=

    work page 2024

  7. [7]

    Proceedings of the National Academy of Sciences , volume=

    Collective decision making by rational individuals , author=. Proceedings of the National Academy of Sciences , volume=. 2018 , publisher=

    work page 2018

  8. [8]

    Applied Soft Computing , volume=

    Learning non-cooperative game for load balancing under self-interested distributed environment , author=. Applied Soft Computing , volume=. 2017 , publisher=

    work page 2017

  9. [9]

    IEEE Transactions on Signal and Information Processing over Networks , volume=

    Information-sharing over adaptive networks with self-interested agents , author=. IEEE Transactions on Signal and Information Processing over Networks , volume=. 2015 , publisher=

    work page 2015

  10. [10]

    IEEE Transactions on Automatic Control , volume=

    When selfish is socially optimal , author=. IEEE Transactions on Automatic Control , volume=. 2021 , publisher=

    work page 2021

  11. [11]

    Annual Reviews in Control , volume=

    A survey of distributed optimization , author=. Annual Reviews in Control , volume=. 2019 , publisher=

    work page 2019

  12. [12]

    INFORMS Journal on Computing , year=

    Penalty decomposition methods for second-best congestion pricing problems on large-scale networks , author=. INFORMS Journal on Computing , year=

    work page

  13. [13]

    A primal-dual approach to constrained

    Chen, Yi and Dong, Jing and Wang, Zhaoran and Zhang, Chuheng , journal=. A primal-dual approach to constrained. 2025 , volume=

    work page 2025

  14. [14]

    Manufacturing & Service Operations Management , volume=

    Efficient Cloud Server Deployment Under Demand Uncertainty , author=. Manufacturing & Service Operations Management , volume=. 2025 , publisher=

    work page 2025

  15. [15]

    Automatica , volume=

    Distributed optimal coordination of multi-agent systems with coupled objective functions: A fixed-time estimation-based approach , author=. Automatica , volume=. 2025 , publisher=

    work page 2025

  16. [16]

    IEEE Transactions on Automatic Control , volume=

    Distributed convex optimization with inequality constraints over time-varying unbalanced digraphs , author=. IEEE Transactions on Automatic Control , volume=. 2018 , publisher=

    work page 2018

  17. [17]

    IEEE Transactions on Automatic Control , volume=

    Distributed constrained optimization by consensus-based primal-dual perturbation method , author=. IEEE Transactions on Automatic Control , volume=. 2014 , publisher=

    work page 2014

  18. [18]

    Automatica , volume=

    Distributed event-triggered algorithm for convex optimization with coupled constraints , author=. Automatica , volume=. 2024 , publisher=

    work page 2024

  19. [19]

    IEEE Transactions on Automatic Control , volume=

    On distributed convex optimization under inequality and equality constraints , author=. IEEE Transactions on Automatic Control , volume=. 2011 , publisher=

    work page 2011

  20. [20]

    IEEE Transactions on Signal Processing , volume=

    Distributed primal-dual method for convex optimization with coupled constraints , author=. IEEE Transactions on Signal Processing , volume=. 2021 , publisher=

    work page 2021

  21. [21]

    Consensus-based

    El Tonbari, Mohamed and Ahmed, Shabbir , journal=. Consensus-based. 2023 , publisher=

    work page 2023

  22. [22]

    IEEE transactions on automatic control , volume=

    Distributed asynchronous deterministic and stochastic gradient optimization algorithms , author=. IEEE transactions on automatic control , volume=. 2003 , publisher=

    work page 2003

  23. [23]

    IFAC proceedings volumes , volume=

    Decentralized multi-agent optimization via dual decomposition , author=. IFAC proceedings volumes , volume=. 2011 , publisher=

    work page 2011

  24. [24]

    IEEE Transactions on Signal Processing , volume=

    Distributed sparse linear regression , author=. IEEE Transactions on Signal Processing , volume=. 2010 , publisher=

    work page 2010

  25. [25]

    Multi-agent distributed optimization via inexact consensus

    Chang, Tsung-Hui and Hong, Mingyi and Wang, Xiangfeng , journal=. Multi-agent distributed optimization via inexact consensus. 2014 , publisher=

    work page 2014

  26. [26]

    A proximal dual consensus

    Chang, Tsung-Hui , journal=. A proximal dual consensus. 2016 , publisher=

    work page 2016

  27. [27]

    Automatica , volume=

    On linear convergence of a distributed dual gradient algorithm for linearly constrained separable convex problems , author=. Automatica , volume=. 2015 , publisher=

    work page 2015

  28. [28]

    European journal of operational research , volume=

    Parallel subgradient algorithm with block dual decomposition for large-scale optimization , author=. European journal of operational research , volume=. 2022 , publisher=

    work page 2022

  29. [29]

    IEEE Transactions on Automatic Control , volume=

    A duality-based approach for distributed min--max optimization , author=. IEEE Transactions on Automatic Control , volume=. 2018 , publisher=

    work page 2018

  30. [30]

    IEEE Transactions on Control of Network Systems , volume=

    Constraint-coupled distributed optimization: A relaxation and duality approach , author=. IEEE Transactions on Control of Network Systems , volume=. 2019 , publisher=

    work page 2019

  31. [31]

    SIAM Journal on Optimization , volume=

    Extra: An exact first-order algorithm for decentralized consensus optimization , author=. SIAM Journal on Optimization , volume=. 2015 , publisher=

    work page 2015

  32. [32]

    IEEE Transactions on Automatic Control , volume=

    Distributed proximal algorithms for multiagent optimization with coupled inequality constraints , author=. IEEE Transactions on Automatic Control , volume=. 2020 , publisher=

    work page 2020

  33. [33]

    Distributed saddle-point subgradient algorithms with

    Mateos-N. Distributed saddle-point subgradient algorithms with. IEEE Transactions on Automatic Control , volume=. 2016 , publisher=

    work page 2016

  34. [34]

    SIAM Journal on Control and Optimization , volume=

    Linear time average consensus and distributed optimization on fixed graphs , author=. SIAM Journal on Control and Optimization , volume=. 2017 , publisher=

    work page 2017

  35. [35]

    Econometrica , volume=

    Dynamic mechanism design: A myersonian approach , author=. Econometrica , volume=. 2014 , publisher=

    work page 2014

  36. [36]

    IEEE Transactions on Power Systems , volume=

    Nash mechanisms for market design based on distribution locational marginal prices , author=. IEEE Transactions on Power Systems , volume=. 2022 , publisher=

    work page 2022

  37. [37]

    IEEE Transactions on Power Systems , volume=

    Distribution locational marginal pricing for optimal electric vehicle charging management , author=. IEEE Transactions on Power Systems , volume=. 2013 , publisher=

    work page 2013

  38. [38]

    IEEE Transactions on Power Systems , volume=

    Assessment of transmission congestion cost and locational marginal pricing in a competitive electricity market , author=. IEEE Transactions on Power Systems , volume=. 2004 , publisher=

    work page 2004

  39. [39]

    Applied Energy , volume=

    Pricing mechanisms design for guiding electric vehicle charging to fill load valley , author=. Applied Energy , volume=. 2016 , publisher=

    work page 2016

  40. [40]

    The Journal of finance , volume=

    Counterspeculation, auctions, and competitive sealed tenders , author=. The Journal of finance , volume=. 1961 , publisher=

    work page 1961

  41. [41]

    Public choice , pages=

    Multipart pricing of public goods , author=. Public choice , pages=. 1971 , publisher=

    work page 1971

  42. [42]

    Econometrica: Journal of the Econometric Society , pages=

    Incentives in teams , author=. Econometrica: Journal of the Econometric Society , pages=. 1973 , publisher=

    work page 1973

  43. [43]

    Automatically improved

    Qian, Tao and Shao, Chengcheng and Shi, Di and Wang, Xiuli and Wang, Xifan , journal=. Automatically improved. 2021 , publisher=

    work page 2021

  44. [44]

    Management Science , volume=

    Is price commitment a better solution to control carbon emissions and promote technology investment? , author=. Management Science , volume=. 2023 , publisher=

    work page 2023

  45. [45]

    Communications of the ACM , volume=

    Algorithmic game theory , author=. Communications of the ACM , volume=. 2010 , publisher=

    work page 2010

  46. [46]

    IEEE Transactions on Smart Grid , volume=

    Distributed convex optimization for electric vehicle aggregators , author=. IEEE Transactions on Smart Grid , volume=. 2016 , publisher=

    work page 2016

  47. [47]

    Neurocomputing , pages=

    Differentially private consensus and distributed optimization in multi-agent systems: A review , author=. Neurocomputing , pages=. 2024 , publisher=

    work page 2024

  48. [48]

    European Journal of Operational Research , volume=

    Altruistic profit allocation rules for joint replenishment with carbon cap-and-trade policy , author=. European Journal of Operational Research , volume=. 2021 , publisher=

    work page 2021

  49. [49]

    European Journal of Operational Research , volume=

    Cap-and-trade under a dual-channel setting in the presence of information asymmetry , author=. European Journal of Operational Research , volume=. 2025 , publisher=

    work page 2025

  50. [50]

    European Journal of Operational Research , volume=

    A distributed coordination mechanism for supply networks with asymmetric information , author=. European Journal of Operational Research , volume=. 2013 , publisher=

    work page 2013

  51. [51]

    Peer-to-peer electricity market analysis: From variational to generalized

    Le Cadre, H. Peer-to-peer electricity market analysis: From variational to generalized. European Journal of Operational Research , volume=. 2020 , publisher=

    work page 2020

  52. [52]

    European Journal of Operational Research , volume=

    Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem , author=. European Journal of Operational Research , volume=. 2022 , publisher=

    work page 2022

  53. [53]

    European Journal of Operational Research , volume=

    Dual subgradient method with averaging for optimal resource allocation , author=. European Journal of Operational Research , volume=. 2018 , publisher=

    work page 2018

  54. [54]

    European Journal of Operational Research , volume=

    Selfish-dilemma consensus analysis for group decision making in the perspective of cooperative game theory , author=. European Journal of Operational Research , volume=. 2023 , publisher=

    work page 2023

  55. [55]

    European Journal of Operational Research , volume=

    Network revenue management game in the railway industry: Stackelberg equilibrium, global optimality, and mechanism design , author=. European Journal of Operational Research , volume=. 2024 , publisher=

    work page 2024

  56. [56]

    European Journal of Operational Research , volume=

    Design and analysis of mechanisms for decentralized joint replenishment , author=. European Journal of Operational Research , volume=. 2017 , publisher=

    work page 2017

  57. [57]

    Generic negotiation mechanisms with side payments --

    Homberger, J. Generic negotiation mechanisms with side payments --. European Journal of Operational Research , volume=. 2017 , publisher=

    work page 2017

  58. [58]

    European Journal of Operational Research , volume=

    Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling , author=. European Journal of Operational Research , volume=. 2016 , publisher=

    work page 2016

  59. [59]

    European journal of operational research , volume=

    The capacitated directed cycle hub location and routing problem under congestion , author=. European journal of operational research , volume=. 2021 , publisher=

    work page 2021

  60. [60]

    European Journal of Operational Research , volume=

    Signaling or not? The pricing strategy under fairness concerns and cost information asymmetry , author=. European Journal of Operational Research , volume=. 2025 , publisher=

    work page 2025

  61. [61]

    European Journal of Operational Research , volume=

    Negotiation mechanisms for the multi-agent multi-mode resource investment problem , author=. European Journal of Operational Research , volume=. 2021 , publisher=

    work page 2021

  62. [62]

    European Journal of Operational Research , volume=

    Optimal day-ahead offering strategy for large producers based on market price response learning , author=. European Journal of Operational Research , volume=. 2024 , publisher=

    work page 2024

  63. [63]

    European Journal of Operational Research , volume=

    Biform game consensus analysis of group decision making with unconnected social network , author=. European Journal of Operational Research , volume=. 2025 , publisher=

    work page 2025

  64. [64]

    2015 , publisher=

    B. 2015 , publisher=

    work page 2015

  65. [65]

    2009 , publisher=

    Bullo, Francesco and Cort. 2009 , publisher=

    work page 2009

  66. [66]

    Automatica , volume=

    Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems , author=. Automatica , volume=. 2016 , publisher=

    work page 2016

  67. [67]

    IEEE Transactions on Automatic Control , volume=

    Distributed subgradient methods for multi-agent optimization , author=. IEEE Transactions on Automatic Control , volume=. 2009 , publisher=

    work page 2009

  68. [68]

    Facchinei, Francisco and Pang, Jong-Shi , year=

    work page

  69. [69]

    arXiv preprint arXiv:2310.15596 , year=

    Decentralized proximal method of multipliers for convex optimization with coupled constraints , author=. arXiv preprint arXiv:2310.15596 , year=

    work page arXiv

  70. [70]

    IEEE Transactions on Automatic Control , volume=

    Distributed optimization with coupling constraints , author=. IEEE Transactions on Automatic Control , volume=. 2023 , publisher=

    work page 2023

  71. [71]

    IEEE Transactions on Signal Processing , volume=

    Distributed dual gradient tracking for resource allocation in unbalanced networks , author=. IEEE Transactions on Signal Processing , volume=. 2020 , publisher=

    work page 2020

  72. [72]

    Privacy-preserving distributed

    Zhang, Zhen and Yang, Shaofu and Xu, Wenying and Di, Kai , journal=. Privacy-preserving distributed. 2022 , publisher=

    work page 2022

  73. [73]

    Xie, Dongwei and Wang, Xuhao , title =

    work page

  74. [74]

    European Journal of Operational Research , volume=

    Strategic financing options in a supply chain facing guarantee shortages and capital constraints under demand uncertainty , author=. European Journal of Operational Research , volume=. 2025 , publisher=

    work page 2025

  75. [75]

    Energy Conversion and Management , volume=

    Evaluation of economic benefits of virtual power plant between demand and plant sides based on cooperative game theory , author=. Energy Conversion and Management , volume=. 2021 , publisher=

    work page 2021

  76. [76]

    IEEE Transactions on Control of Network Systems , volume=

    An online mechanism for resource allocation in networks , author=. IEEE Transactions on Control of Network Systems , volume=. 2020 , publisher=

    work page 2020

  77. [77]

    Distributed generalized

    Yang, Shaofu and Xu, Wenying and He, Wangli and Cao, Jinde , journal=. Distributed generalized. 2024 , publisher=

    work page 2024

  78. [78]

    Automatica , volume =

    Dual decomposition for multi-agent distributed optimization with coupling constraints , author =. Automatica , volume =. 2017 , publisher=

    work page 2017

  79. [79]

    Econometrica , volume =

    Robust Mechanism Design , author =. Econometrica , volume =

    work page

  80. [80]

    Chaos: An Interdisciplinary Journal of Nonlinear Science , volume =

    Bai, Haomin and Xu, Wenying and Yang, Shaofu and Cao, Jinde , title =. Chaos: An Interdisciplinary Journal of Nonlinear Science , volume =

    work page

Showing first 80 references.