A market-based optimization algorithm for distributed systems

Management Science

Volumn 53, Issue 8, 2007, Pages 1345-1358

  Guo, Zhiling ^a   Koehler, Gary J ^b   Whinston, Andrew B ^c  

^a Baltimore County   (United States)

^b UNIVERSITY OF FLORIDA   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

Algorithm; Decomposition; Distributed systems; Market based; Resource allocation

Indexed keywords

ALGORITHMS; OPERATING COSTS; PROBLEM SOLVING; REAL TIME CONTROL; RESOURCE ALLOCATION;

DISTRIBUTED SYSTEMS; MARKET-CLEARING PRICES;

OPTIMIZATION;

EID: 38549157180     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1060.0690     Document Type: Article

References (17)

1. Benders, J. F. 1962. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4 238-252.
2. Bertsekas, D. P. 1981. A new algorithm for the assignment problem. Math. Programming 21 152-171.
3. Bertsekas, D. P. 1990. The auction algorithm for assignment and other network flow problems: A tutorial. Interfaces 20(4) 133-149.
4. Bertsimas, D., J. N. Tsitsiklis. 1997. Introduction to Linear Optimization. Athena Scientific, Belmont, MA.
5. Dantzig, G. B., P. Wolfe. 1960. The decomposition principle for linear programs. Oper. Res. 8 101-111.
6. Fan, M., J. Stallaert, A. B. Whinston. 2003. Decentralized mechanism design for supply chain organizations using auction market. Inform. Systems Res. 14(1) 1-22.
7. Gallien, J., L. M. Wein. 2005. A smart market for industrial procurement with capacity constraints. Management Sci. 51(1) 76-91.
8. Gilmore, P. C., R. E. Gomory. 1961. A linear programming approach to the cutting stock problem. Oper. Res. 9 849-859.
9. Hurwicz, L. 1960. Optimality and information efficiency in resource allocation processes. K. J. Arrow, S. Karlin, P. Suppes, eds. Mathematical Methods in the Social Sciences. Stanford University Press, Stanford, CA, 27-46.
10. Jennergren, L. P., W. Muller. 1973. Simulation experiments of resource-allocation decisions in two-level organizations. Soc. Sci. Res. 2 333-352.
11. Kelley, J. E. 1960. The cutting-plane method for solving convex programs. J. SIAM 8(4) 703-712.
12. Meyerson, R. B., M. A. Satterthwaite. 1983. Efficient mechanisms for bilateral trading. J. Econom. Theory 28 265-281.
13. Nabrzyski, J., J. M. Schopf, J. Weglarz. 2004. Grid Resource Management: State of the Art and Future Trends. Kluwer Academic Publishers, Norwell, MA.
14. O'Hara, M. 1995. Market Microstructure Theory. Blackwell Publishing, Malden, MA.
15. Parkes, D. C., L. H. Ungar. 2000. Iterative combinatorial auctions: Theory and practice. Proc. 17th National Conf Artificial Intelligence (AAAI-OO). AAAI, Menlo Park, CA, 74-81.
16. Rothkopf, M. H., A. Pekec, R. M. Harstad. 1998. Computationally manageable combinational auctions. Management Sci 44(8) 1131-1147.
17. Vollman, T. E., W L. Berry, D. C. Whybark. 1992. Manufacturing Planning and Control Systems. Irwin, Homewood, IL.