Distributed GNE-Seeking under Partial Information Based on Preconditioned Proximal-Point Algorithms
نویسندگان
چکیده
This paper proposes a distributed algorithm for games with shared coupling constraints based on the variational approach and proximal-point algorithm. The demonstrates effectiveness of in computing generalized Nash equilibrium (GNE) problems using local data communication neighbors any networked game. achieves goal reflecting decisions Nash–Cournot game under partial-decision information while maintaining nature convergence
منابع مشابه
Four parameter proximal point algorithms
Several strong convergence results involving two distinct four parameter proximal point algorithms are proved under different sets of assumptions on these parameters and the general condition that the error sequence converges to zero in norm. Thus our results address the two important problems related to the proximal point algorithm − one being of strong convergence (instead of weak convergence...
متن کاملRole of Information and Organization Structures on Distributed Auction Algorithms: Point-to-Point Communication Architecture
This paper presents how information organizational structures with point-to-point communication structure impact team coordination in a distributed task-asset allocation problem. A key distinguishing characteristic of this problem is that each DM knows only a part of the weight matrix and/or controls a subset of the assets. Here, we extend the distributed algorithm developed for blackboard comm...
متن کاملDistributed Auction Algorithms for the Assignment Problem with Partial Information
operations centers (MOC), in which multiple DMs with partial information and partial control over assets are involved in the development of operational level plans. The MOC emphasizes standardized processes and methods, centralized assessment and guidance, networked distributed planning capabilities, and decentralized execution for assessing, planning and executing missions across a range of mi...
متن کاملPartial Proximal Minimization Algorithms for Convex Pprogramming
We consider an extension of the proximal minimization algorithm where only some of the minimization variables appear in the quadratic proximal term. We interpret the resulting iterates in terms of the iterates of the standard algorithm and we show a uniform descent property, which holds independently of the proximal terms used. This property is used to give simple convergence proofs of parallel...
متن کاملInexact and accelerated proximal point algorithms
We present inexact accelerated proximal point algorithms for minimizing a proper lower semicontinuous and convex function. We carry on a convergence analysis under different types of errors in the evaluation of the proximity operator, and we provide corresponding convergence rates for the objective function values. The proof relies on a generalization of the strategy proposed in [14] for genera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied sciences
سال: 2023
ISSN: ['2076-3417']
DOI: https://doi.org/10.3390/app13116405