Baisravan HomChaudhuri and Manish Kumar
 R.A. Giliano and P.A. Mitchem, Valuation of network com-puting resources, S.H. Clearwater (ed.), Market based control:A paradigm for distributed resource allocation (New Jersey:World Scientiﬁc Publishing, 1996), 28–52.
 K. Harty and D. Cheriton, A market approach to operatingsystem memory allocation, S.H. Clearwater (ed.), Market basedcontrol: A paradigm for distributed resource allocation (NewJersey: World Scientiﬁc Publishing, 1996), 126–155.
 D.F. Ferguson, C. Nickolaou, J. Sairamesh, and Y. Yemini,Economic models for allocating resources in computer systems,S.H. Clearwater (ed.), Market based control: A paradigm fordistributed resource allocation (New Jersey: World ScientiﬁcPublishing, 1996), 156–183.
 K. Kuwabara, T. Ishida, Y. Nishibe, and T. Suda, An equi-libratory market-based approach for distributed resource allo-cation and its application to communication network control,S.H. Clearwater (ed.), Market based control: A paradigm fordistributed resource allocation (New Jersey: World ScientiﬁcPublishing, 1996), 53–73.
 A.D. Baker, A case study where agents bid with actual coststo schedule a factory, S.H. Clearwater (ed.), Market basedcontrol: A paradigm for distributed resource allocation (NewJersey: World Scientiﬁc Publishing, 1996), 184–223.
 H. Voos, Resource allocation in continuous production usingmarket-based multi-agent systems, 5th IEEE Int. Conf. onIndustrial Informatics, 2, 2007, 1085–1090.
 D.P. Bertsekas and J.N. Tsitsiklis, Parallel and distributedcomputation: Numerical methods, (Belmont: Athena Scientiﬁc,1997).
 J.N. Tsitsiklis, Problems in decentralized decision making andcomputation, Ph.D. Thesis, Massachusetts Institute of Tech-nology, Cambridge, MA, 1984.
 S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomizedgossip algorithms, IEEE Transactions on Information Theory,52, 2006, 2508–2530.
 R.A. Freeman, P. Yang, and K.M. Lynch, Stability and con-vergence properties of dynamic average consensus estimators,Proc. IEEE Conf. on Decision and Control, San Diego, CA,2006, 398–403.
 A. Jadbabaie, J. Lin, and A.S. Morse, Coordination of groupsof mobile autonomous agents using nearest neighbor rules,IEEE Transactions on Automatic Control, 48, 2003, 988–1001.
 A. Nedic and A. Ozdaglar, Distributed subgradient methodsfor multi-agent optimization, IEEE Transactions on AutomaticControl, 54, 2009, 48–61.
 A. Nedic, A. Ozdaglar, and P.A. Parrilo, Constrained consensusand optimization in multi-agent networks, IEEE Transactionson Automatic Control, 55(4), 2010, 922–938.
 A.W. Colombo, R. Schoop, and R. Neubert, Collaborative(agent-based) factory automation, R. Zurawski (ed.), TheIndustrial Information Technology Handbook (Boca Raton,FL: CRC Press, 2004).
 N. Jennings and S. Bussmann, Agent-based control, IEEEControl Systems Magazine, 23, 2003.
 F. Kl¨ugl, A.L.C. Bazzan, and S. Ossowski, Applications of agenttechnology in traﬃc and transportation, (Berlin, Germany:Birkhauser Verlag, 2005).
 G.B. Dantzig and P. Wolfe, Decomposition principle for linearprograms, Operations Research, 8(1), 1960, 101–111.
 M. Zhu and S. Mart´inez, On distributed optimization underinequality constraints via lagrangian primal-dual methods,American Control Conf., Baltimore, MD, 2010, 4863–4868.
 J.F. Benders, Partitioning procedures for solving mixed vari-ables programming problems, Numerische Mathematik, 4,1962, 238–252.
 P.C. Gilmore and R.E. Gomory, A linear programming ap-proach to the cutting stock problem, Operations Research, 9,1961, 849–859.
 J.E. Kelley, The cutting-plane method for solving convex pro-grams, Journal of the Society of Industrial Applied Mathemat-ics, 8, 1960, 703–712.
 A.M. GeoKrion and G.W. Graves, Multicommodity distribu-tion system design by Benders decomposition, ManagementScience, 20, 1974, 822–844.
 J.F. Cordeau, F. Pasin, and M.M. Solomon, An integratedmodel for logistics network design, Annals of Operations Re-search, 144, 2006, 59–82.
 M. Florian, G. GuXerin, and G. Bushel, The engine schedulingproblem on a railway network, INFOR, 14, 1976, 121–138.
 J.F. Cordeau, F. Soumis, and J. Desrosiers, A Benders de-composition approach for the locomotive and car assignmentproblem, Transportation Science, 34, 2000, 133–149.
 J.F. Cordeau, F. Soumis, and J. Desrosiers, Simultaneous as-signment of locomotives and cars to passenger trains, Opera-tions Research, 49, 2001, 531–548.
 X. Cai, D.C. McKinney, L.S. Lasdon, and D.W. Watkins Jr.,Solving large non-convex water resources management modelsusing generalized Benders decomposition, Operations Research,49, 2001, 235–245.
 G. Zhao, A log-barrier method with Benders decompositionfor solving two-stage stochastic linear programs, MathematicalProgramming, 90, 2001, 507–536.
 M. Karlsson and F. Ygge, Market-based approaches to opti-mization, Computational Intelligence, 23, 2007, 92–109.
 A. Papavasiliou, H. Hindi, and D. Greene, Market-based controlmechanism for electric power demand response, Proc. IEEEConf. on Decision and Control, Atlanta, GA, 2010.
 F. Kelly, A. Maulloo, and D. Tan, Rate control of commu-nication networks: Shadow prices, proportional fairness and11stability, Journal of Operations Research Society, 38, 1998,377–385.
 S.H. Clearwater, Market-based control: A paradigm for dis-tributed resource allocation (New Jersey: World ScientiﬁcPublishing, 1996).
 J.F. Kurose and R. Simha, A microeconomic approach tooptimal resource allocation in distributed computer systems,IEEE Transactions on Computers, 38, 1989, 705–717.
 D. Bertsekas, Auction algorithms for network ﬂow problems:A tutorial introduction, Computational Optimization and Ap-plications, 1, 1992, 7–66.
 A.Th. Schreiber, Knowledge engineering and management:The common KADS methodology (Cambridge: The MIT Press,2000).
 F. Ygge, Market-oriented programming and its applicationto power load management, Ph.D. Thesis, Department ofComputer Science, Lund University, Lund, Sweden, 1998.
 R. Buyya, D. Abramson, J. Giddy, and H. Stockinger, Eco-nomic models for resource management and scheduling in gridcomputing, The Journal of Concurrency and Computation,14, 2002, 1507–1542.
 Z. Tan and J.R. Gurd, Market-based grid resource allocationusing a stable continuous double auction, Proc. 8th IEEE/ACMInt. Conf. on Grid Computing, Austin, TX, 2007, 283–290.
 J.E. Stiglitz, Pareto optimality and competition, Pareto Opti-mality and Competition, 36, 1981, 235–251.
 M.L. Fisher, R. Jaikumar, and L.N.V. Wassenhove, A multiplieradjustment method for the generalized assignment problem,Management Science, 32(9), 1986, 1095–1103.
 D.W. Pentico, Assignment problems: A golden anniversarysurvey, European Journal of Operational Research, 176, 2007,774–793.
 M.D. Grigoriadis, D.J. Tang, and L.S. Woo, Considerations inthe optimal synthesis of some communications networks, 45thJoint National ORSA/TIMS Meeting, San Juan, PR, 1974.
 M.L. Fisher and R. Jaikumar, A generalized assignment heuris-tic for vehicle routing, Networks, 11, 1981, 109–124.
 V. Balachandran, An integer generalized transportation modelfor optimal job assignment in computer networks, OperationsResearch, 24(4), 1976, 742–759.
 D. Gross and C.E. Pinkus, Optimal allocation of ships to yardsfor regular overhauls, Technical Memorandum, 63095, 1972.
 B.P. Gerkey and M.J. Mataric, Multi-robot task allocation:Analyzing the complexity and optimality of key architectures,Proc. IEEE Int. Conf. on Robotics and Automation, ICRA’03,3, 2003, 3862–3868.
 B. HomChaudhuri and M. Kumar, Market based allocationof power in smart grid, Proc. American Control Conf., SanFrancisco, CA, 2011, 3251–3256.
 B. HomChaudhuri, M. Kumar, and V. Devabhaktuni, A marketbased distributed optimization for power allocation in smartgrid, Proc. Dynamic System and Control Conf., Arlington,VA, 2011.
 S. Zhao, B. HomChaudhuri, and M. Kumar, A method fordistributed optimization for task allocation, Proc. ASME 2009Dynamic Systems and Control Conf., Hollywood, CA, 2009.
 M. Kojima, S. Mizuno, and A. Yoshise, A primal-dual interiorpoint algorithm for linear programming (New York: Springer-Verlag, 1988).