A Market-Based Optimization Algorithm for Distributed Systems

In this paper, a market-based decomposition method for decomposable linear systems is developed. The solution process iterates between a master problem that solves the market-matching problem, and subproblems that solve the agents' bundle-determination problems. Starting from any initial price and feasible allocation, system optimality can be achieved under a dynamic market-trading algorithm in a finite number of trades. The final market-clearing prices are discovered by this market trading and an efficient allocation is achieved by direct, wealth-improving resource exchanges among self-interested agents. Certain types of strategic behavior by the agents and a dealer in the marketplace are studied as well. Our proposed market mechanism addresses price dynamics, incentive issues, and economic transactions of real-world, distributed decision-making situations more realistically than traditional decomposition approaches. In addition, it can be operated in both synchronous and asynchronous environments. We provide a market-based paradigm for decentralized problem solving and information processing that can be easily implemented to support real-time optimization of distributed systems.

[1]  M. Satterthwaite,et al.  Efficient Mechanisms for Bilateral Trading , 1983 .

[2]  David C. Parkes,et al.  Iterative Combinatorial Auctions , 2006 .

[3]  Moshe Ben-Horim,et al.  A linear programming approach , 1977 .

[4]  Dimitri P. Bertsekas,et al.  The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

[5]  G. Dantzig.  23. A Decomposition Principle for Linear Programs , 1963 .

[6]  John N. Tsitsiklis,et al.  Introduction to linear optimization , 1997, Athena scientific optimization and computation series.

[7]  Andrew B. Whinston,et al.  Decentralized Mechanism Design for Supply Chain Organizations Using an Auction Market , 2003, Inf. Syst. Res..

[8]  Dimitri P. Bertsekas,et al.  A new algorithm for the assignment problem , 1981, Math. Program..

[9]  Peter Jennergren,et al.  Simulation experiments of resource-allocation decisions in two-level organizations , 1973 .

[10]  J. E. Kelley,et al.  The Cutting-Plane Method for Solving Convex Programs , 1960 .

[11]  Ronald M. Harstad,et al.  Computationally Manageable Combinational Auctions , 1998 .

[12]  William L. Berry,et al.  Manufacturing Planning and Control Systems , 1984 .

[13]  Jérémie Gallien,et al.  A Smart Market for Industrial Procurement with Capacity Constraints , 2005, Manag. Sci..

[14]  David C. Parkes,et al.  Iterative Combinatorial Auctions: Theory and Practice , 2000, AAAI/IAAI.

[15]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[16]  Jacques F. Benders,et al.  Partitioning procedures for solving mixed-variables programming problems , 2005, Comput. Manag. Sci..

[17]  L. Hurwicz.  Studies in Resource Allocation Processes: Optimality and informational efficiency in resource allocation processes , 1977 .

[18]  Jarek Nabrzyski,et al.  Grid Resource Management , 2004 .

[19]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .

[20]  Maureen O'Hara,et al.  Market Microstructure Theory , 1995 .

[21]  Jarek Nabrzyski,et al.  Grid resource management: state of the art and future trends , 2004 .