Premium
Design of multi‐actor distributed processing systems: A game‐theoretical approach
Author(s) -
Torres Ana I.,
Stephanopoulos George
Publication year - 2016
Publication title -
aiche journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.958
H-Index - 167
eISSN - 1547-5905
pISSN - 0001-1541
DOI - 10.1002/aic.15395
Subject(s) - convexity , nash equilibrium , computer science , mathematical optimization , process (computing) , game theory , point (geometry) , product (mathematics) , lagrangian , feature (linguistics) , industrial engineering , distributed computing , mathematical economics , mathematics , engineering , economics , linguistics , philosophy , geometry , financial economics , operating system , mathematical physics
The manufacturing of a final product could be the result of a value chain involving several processing plants distributed across several distinct owners; a feature that may prevent the application of classical process design approaches that depend on a centralized treatment of the complete processing network. In this article we propose and develop a game‐theoretical framework and specific methodologies, which allow the optimal design of distributed processing systems, through the decentralized strategies of independent actors. The resulting process design corresponds to a Nash Equilibrium point among the interacting actors. Its optimality and the justification of the independent strategies that led to it, are theoretically based on (and constrained by) the properties of the 2‐level Lagrangian approach. The article also discusses the use of penalty‐term approaches, which can extend the applicability of the proposed framework and design methodologies to problems for which the underlying convexity assumptions of the 2‐level Lagrangian approach may not be possible to ascertain. A series of case studies illustrate the application of the proposed ideas to distributed processing networks of various structures. © 2016 American Institute of Chemical Engineers AIChE J , 62: 3369–3391, 2016