{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T18:42:13Z","timestamp":1761417733739},"reference-count":60,"publisher":"Springer Science and Business Media LLC","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10458-009-9086-9","type":"journal-article","created":{"date-parts":[[2009,4,7]],"date-time":"2009-04-07T09:25:31Z","timestamp":1239096331000},"page":"308-341","source":"Crossref","is-referenced-by-count":4,"title":["Coordination by design and the price of autonomy"],"prefix":"10.1007","volume":"20","author":[{"given":"Adriaan","family":"ter Mors","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chetan","family":"Yadati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cees","family":"Witteveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yingqian","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,8]]},"reference":[{"issue":"11","key":"9086_CR1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J.F. Allen","year":"1983","unstructured":"Allen J.F. (1983) Maintaining knowledge about temporal intervals. Communications of the ACM 26(11): 832\u2013843. doi: 10.1145\/182.358434","journal-title":"Communications of the ACM"},{"key":"9086_CR2","unstructured":"Bart\u00e1k, R., M\u00fcller, T., & Rudov\u00e1, H. (2003). A new approach to modelling and solving minimal perturbation problems. In Recent advances in constraints (pp. 223\u2013249). New York, NY: Springer-Verlag."},{"key":"9086_CR3","doi-asserted-by":"crossref","unstructured":"Beaumont, O., Boudet, V., & Robert, Y. (2002). The iso-level scheduling heuristic for heterogeneous processors. In Proceedings of 10th Euromicro workshop on parallel, distributed and network-based processing (pp. 335\u2013350). doi: 10.1109\/EMPDP.2002.994304.","DOI":"10.1109\/EMPDP.2002.994304"},{"key":"9086_CR4","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., Chmeiss, A., & Sais, L. (2001). Neighborhood-based variable ordering heuristics for the constraint satisfaction problem. In CP\u201901: Proceedings of the 7th international conference on principles and practice of constraint programming (pp. 565\u2013569). London, UK: Springer-Verlag.","DOI":"10.1007\/3-540-45578-7_40"},{"issue":"4","key":"9086_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/1780.1781","volume":"6","author":"R. Bird","year":"1984","unstructured":"Bird R. (1984) The promotion and accumulation strategies in transformational programming. ACM Transactions on Programming Languages and Systems 6(4): 487\u2013504","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"3","key":"9086_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.tcs.2007.02.045","volume":"379","author":"M. Bodirsky","year":"2007","unstructured":"Bodirsky M., Gr\u00f6pl C., Kang M. (2007) Generating labeled planar graphs uniformly at random. Theoretical Computer Science 379(3): 377\u2013386","journal-title":"Theoretical Computer Science"},{"key":"9086_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511598975","volume-title":"Fair division: From cake cutting to dispute resolution","author":"S.J. Brams","year":"1996","unstructured":"Brams S.J., Taylor A.D. (1996) Fair division: From cake cutting to dispute resolution. Cambridge University Press, New York, NY"},{"issue":"2","key":"9086_CR8","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1023\/A:1008947018074","volume":"11","author":"G. Bruno","year":"2000","unstructured":"Bruno G., Ghiani G., Improta G. (2000) Dynamic positioning of idle automated guided vehicles. Journal of Intelligent Manufacturing 11(2): 209\u2013215","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"2","key":"9086_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1108\/17410380710722881","volume":"18","author":"N. Buyurgan","year":"2007","unstructured":"Buyurgan N., Meyyappan L., Saygin C., Dagli C.H. (2007) Real-time routing selection for automated guided vehicles in a flexible manufacturing system. Journal of Manufacturing Technology 18(2): 169\u2013181","journal-title":"Journal of Manufacturing Technology"},{"issue":"2","key":"9086_CR10","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10458-005-6104-4","volume":"12","author":"P.C. Buzing","year":"2006","unstructured":"Buzing P.C., ter Mors A.W., Valk J.M., Witteveen C. (2006) Coordinating self-interested planning agents. Autonomous Agents and Multi-Agent Systems 12(2): 199\u2013218","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9086_CR11","unstructured":"Clement, B., Barrett, A., Rabideau, G., & Durfee, E. (2001). Using abstraction in planning and scheduling. In Proceedings of the sixth European conference on planning (ECP-01) (pp. 145\u2013156)."},{"key":"9086_CR12","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1613\/jair.2158","volume":"28","author":"B.J. Clement","year":"2007","unstructured":"Clement B.J., Durfee E.H., Barrett A.C. (2007) Abstract reasoning for planning and coordination. Journal of Artificial Intelligence Research 28: 453\u2013515","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9086_CR13","volume-title":"Introduction to algorithms","author":"T.T. Cormen","year":"1990","unstructured":"Cormen T.T., Leiserson C.E., Rivest R.L. (1990) Introduction to algorithms. MIT Press, Cambridge, MA, USA"},{"key":"9086_CR14","doi-asserted-by":"crossref","unstructured":"Cox, J. S., & Durfee, E. H. (2003). Discovering and exploiting synergy between hierarchical planning agents. In Second international joint conference on autonomous agents and multiagent systems (AAMAS\u201903) (pp. 281\u2013288). New York, NY: ACM Press.","DOI":"10.1145\/860575.860621"},{"key":"9086_CR15","unstructured":"Decker, K. S., & Lesser, V. R. (1994). Designing a family of coordination algorithms. In Proceedings of the thirteenth international workshop on distributed artificial intelligence (DAI-94) (pp. 65\u201384). http:\/\/citeseer.nj.nec.com\/decker95designing.html"},{"key":"9086_CR16","first-page":"61","volume":"113","author":"A. Denise","year":"1996","unstructured":"Denise A., Vasconcellos M., Welsh D. (1996) The random planar graph. Congressus Numerantium 113: 61\u201379","journal-title":"Congressus Numerantium"},{"key":"9086_CR17","doi-asserted-by":"crossref","unstructured":"Duinkerken, M. B., Ottjes, J. A., & Lodewijks, G. (2006). Comparison of routing strategies for AGV systems using simulation. In WSC\u201906: Proceedings of the 38th conference on winter simulation (pp. 1523\u20131530).","DOI":"10.1109\/WSC.2006.322922"},{"key":"9086_CR18","unstructured":"Durfee, E. H. (1999). Distributed problem solving and planning. In G. Wei\u00df (Ed.), Multiagent systems: A modern approach to distributed artificial intelligence (pp. 121\u2013164). Cambridge, MA, USA: MIT Press."},{"key":"9086_CR19","doi-asserted-by":"crossref","unstructured":"Durfee, E. H., & Lesser, V. R. (1991). Partial global planning: A coordination framework for distributed hypothesis formation. IEEE Transactions on Systems, Man, and Cybernetics, 21(5), 1167\u20131183. http:\/\/citeseer.nj.nec.com\/durfee91partial.html","DOI":"10.1109\/21.120067"},{"key":"9086_CR20","unstructured":"Ephrati, E., & Rosenschein, J. S. (1993). Multi-agent planning as the process of merging distributed sub-plans. In Proceedings of the twelfth international workshop on distributed artificial intelligence (DAI-93) (pp. 115\u2013129). http:\/\/www.cs.huji.ac.il\/labs\/dai\/papers.html"},{"key":"9086_CR21","doi-asserted-by":"crossref","unstructured":"Foulser, D., Li, M., & Yang, Q. (1992). Theory and algorithms for plan merging. Artificial Intelligence Journal, 57(2\u20133), 143\u2013182. http:\/\/www.cs.sfu.ca\/isa\/pubs\/","DOI":"10.1016\/0004-3702(92)90016-Q"},{"key":"9086_CR22","volume-title":"Computers and intractability\u2014a guide to the theory of NP-completeness","author":"M. Garey","year":"1979","unstructured":"Garey M., Johnson D. (1979) Computers and intractability\u2014a guide to the theory of NP-completeness. W.H. Freeman and Company, New York, NY"},{"key":"9086_CR23","unstructured":"Hatzack, W., & Nebel, B. (2001). The operational traffic problem: Computational complexity and solutions. In A. Cesta (Ed.), Proceedings of the 6th European conference on planning (ECP\u201901) (pp. 49\u201360). New York, NY: Springer-Verlag."},{"issue":"1\u20132","key":"9086_CR24","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/j.tcs.2005.05.008","volume":"343","author":"R.A. Hearn","year":"2005","unstructured":"Hearn R.A., Demaine E.D. (2005) Pspace-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation. Theoretical Computer Science 343(1\u20132): 72\u201396","journal-title":"Theoretical Computer Science"},{"key":"9086_CR25","unstructured":"Helmert, M. (2006). New complexity results for classical planning benchmarks. In Proceedings of the sixteenth international conference on automated planning and scheduling (ICAPS 2006) (pp. 52\u201361). AAAI Press."},{"key":"9086_CR26","unstructured":"Hunsberger, L. (2002a). Algorithms for a temporal decoupling problem in multi-agent planning. In Proceedings of eighteenth national conference on artificial intelligence (pp. 468\u2013475). AAAI Press."},{"key":"9086_CR27","unstructured":"Hunsberger, L. (2002b). Group decision making and temporal reasoning. Ph.D. thesis, Harvard University, Cambridge, MA, USA."},{"key":"9086_CR28","doi-asserted-by":"crossref","unstructured":"Hunsberger, L. (2003). Distributing the control of a temporal network among multiple agents. In Proceedings of the 2nd international joint conference on autonomous agents and multiagent systems (AAMAS) (pp. 899\u2013906). New York, NY, USA: ACM Press.doi: 10.1145\/860575.860621 .","DOI":"10.1145\/860575.860621"},{"issue":"3","key":"9086_CR29","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1017\/S0269888900000205","volume":"8","author":"N.R. Jennings","year":"1993","unstructured":"Jennings N.R. (1993) Commitments and conventions: The foundation of coordination in multi-agent systems. The Knowledge Engineering Review 8(3): 223\u2013250","journal-title":"The Knowledge Engineering Review"},{"key":"9086_CR30","doi-asserted-by":"crossref","unstructured":"Jonker, G., Dignum, F., & Meyer, J. J. (2007). Achieving cooperation among selfish agents in the air traffic management domain using signed money. In Proceedings of the sixth international joint conference on autonomous agents and multiagent systems (AAMAS\u201907) (pp. 1258\u20131260).","DOI":"10.1145\/1329125.1329382"},{"issue":"1","key":"9086_CR31","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(87)90051-8","volume":"33","author":"R.E. Korf","year":"1987","unstructured":"Korf R.E. (1987) Planning as search: A quantitative approach. Artifcial Intelligence 33(1): 65\u201368","journal-title":"Artifcial Intelligence"},{"key":"9086_CR32","unstructured":"Lansky, A. (1990). Localized search for controlling automated reasoning. In Proceedings of the DARPA workshop on innovative approaches to planning, scheduling and control (pp. 115\u2013125)."},{"key":"9086_CR33","unstructured":"Lansky, A. L., & Getoor, L. C. (1995). Scope and abstraction: Two criteria for localized planning. In Proceedings of the international joint conference on artificial intelligence (pp. 1612\u20131618). Morgan Kaufmann."},{"key":"9086_CR34","doi-asserted-by":"crossref","unstructured":"Lesser, V., Decker, K., Wagner, T., Carver, N., Garvey, A., Horling, B., Neiman, D., Podorozhny, R., NagendraPrasad, M., Raja, A., Vincent, R., Xuan, P., & Zhang, X. (2004). Evolution of the GPGP\/TAEMS domain-independent coordination framework. Autonomous Agents and Multi-Agent Systems, 9(1), 87\u2013143. http:\/\/mas.cs.umass.edu\/paper\/268","DOI":"10.1023\/B:AGNT.0000019690.28073.04"},{"key":"9086_CR35","unstructured":"Li, J. (2007). Strategic negotiation models for grid scheduling. Ph.D. thesis, TU Dortmund."},{"key":"9086_CR36","doi-asserted-by":"crossref","unstructured":"Maheswaran, M., & Siegel, H. J. (1998). A dynamic matching and scheduling algorithm for heterogeneous computing systems. In HCW\u201998: Proceedings of the seventh HCW (57\u00a0pp.). IEEE Computer Society.","DOI":"10.1109\/HCW.1998.666545"},{"key":"9086_CR37","unstructured":"Moses, Y., & Tennenholtz, M. (1992). On computational aspects of artificial social systems. In Proceedings of DAI-92 (pp. 267\u2013284)."},{"key":"9086_CR38","volume-title":"Fair division and collective welfare","author":"H. Moulin","year":"2004","unstructured":"Moulin H. (2004) Fair division and collective welfare. MIT Press, Cambridge, MA"},{"key":"9086_CR39","unstructured":"Nisan, N. (1999). Algorithms for selfish agents: Mechanism design for distributed computation. In Proceedings of the 16th annual symposium on theoretical aspects of computer science (pp. 1\u201315). New York, NY: Springer-Verlag."},{"key":"9086_CR40","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. (2001). Algorithms, games, and the internet. In STOC\u201901: Proceedings of the thirty-third annual ACM symposium on theory of computing (pp. 749\u2013753). New York, NY, USA: ACM Press. doi: 10.1145\/380752.380883.","DOI":"10.1145\/380752.380883"},{"key":"9086_CR41","unstructured":"Ran, Y., Roos, N., & van den Herik, J. (2002). Methods for repair based scheduling. In Proceedings of the 21st workshop of the UK Planning and Scheduling Special Interest Group, PLANSIG."},{"key":"9086_CR42","volume-title":"Selfish routing and the price of anarchy","author":"T. Roughgarden","year":"2005","unstructured":"Roughgarden T. (2005) Selfish routing and the price of anarchy. MIT Press, Cambridge, MA"},{"issue":"2","key":"9086_CR43","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T. Roughgarden","year":"2002","unstructured":"Roughgarden T., Tardos E. (2002) How bad is selfish routing?. Journal of the ACM 49(2): 236\u2013259. doi: 10.1145\/506147.506153","journal-title":"Journal of the ACM"},{"key":"9086_CR44","doi-asserted-by":"crossref","unstructured":"Scerri, P., Pynadath, D., Johnson, L., Rosenbloom, P., Si, M., Schurr, N., & Tambe, M. (2003). A prototype infrastructure for distributed robot-agent-person teams. In AAMAS\u201903: Proceedings of the second international joint conference on autonomous agents and multiagent systems (pp. 433\u2013440). New York, NY, USA: ACM Press. doi: 10.1145\/860575.860645.","DOI":"10.1145\/860575.860645"},{"key":"9086_CR45","unstructured":"Schurr, N., Marecki, J., Lewis, J. P., Tambe, M., & Scerri, P. (2005). The DEFACTO system: Training tool for incident commanders. In AAAI (pp. 1555\u20131562)."},{"issue":"1","key":"9086_CR46","first-page":"49","volume":"19","author":"L. Sebastia","year":"2006","unstructured":"Sebastia L., Onaindia E., Marzal E. (2006) Decomposition of planning problems. AI Communications 19(1): 49\u201381","journal-title":"AI Communications"},{"issue":"1\u20132","key":"9086_CR47","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","volume":"101","author":"O. Shehory","year":"1998","unstructured":"Shehory O., Kraus S. (1998) Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1\u20132): 165\u2013200","journal-title":"Artificial Intelligence"},{"key":"9086_CR48","doi-asserted-by":"crossref","unstructured":"Shoham, Y., & Tennenholtz, M. (1995). On social laws for artificial agent societies: Off-line design. Artificial Intelligence, 73(1\u20132), 231\u2013252. http:\/\/citeseer.nj.nec.com\/shoham95social.html","DOI":"10.1016\/0004-3702(94)00007-N"},{"key":"9086_CR49","unstructured":"Sih, G. C., & Lee, E. A. (1990). Scheduling to account for interprocessor communication within interconnection-constrained processor networks. In ICPP (1) (pp. 9\u201316)."},{"key":"9086_CR50","unstructured":"Sims, M., Corkill, D., & Lesser, V. (2004). Separating domain and coordination knowledge in multi-agent organizational design and instantiation. In Proceedings of the AAAI-04 workshop on agent organizations: Theory and practice (pp. 1\u20137). California: AAAI Press. http:\/\/mas.cs.umass.edu\/paper\/381"},{"key":"9086_CR51","doi-asserted-by":"crossref","unstructured":"Steenhuisen, J., Witteveen, C., ter Mors, A. W., & Valk, J. M. (2006). Framework and complexity results for coordinating non-cooperative planning agents. In K. Fischer et\u00a0al. (Eds.), Proceedings of the 4th German conference on multi-agent system technologies (MATES). Lecture Notes in Artificial Intelligence (Vol. 4196, pp. 98\u2013109). New York, NY: Springer-Verlag.","DOI":"10.1007\/11872283_9"},{"key":"9086_CR52","doi-asserted-by":"crossref","unstructured":"Stone, P., & Veloso, M. M. (2002). Layered learning and flexible teamwork in RoboCup simulation agents. In RoboCup-99: Robot soccer world cup III. Lecture Notes in Computer Science (Vol. 1856, pp. 495\u2013508). New York, NY: Springer-Verlag.","DOI":"10.1007\/3-540-45327-X_42"},{"key":"9086_CR53","unstructured":"ter Mors, A. W., Zutt, J., & Witteveen, C. (2007). Context-aware logistic routing and scheduling. In Proceedings of the seventeenth international conference on automated planning and scheduling (pp. 328\u2013335). AAAI Press. http:\/\/dutiih.st.ewi.tudelft.nl\/terMorsZuttWitteveen-icaps-2007.pdf"},{"key":"9086_CR54","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0004-3702(02)00273-4","volume":"142","author":"J. Tonino","year":"2002","unstructured":"Tonino J., Bos A., de Weerdt M., Witteveen C. (2002) Plan coordination by revision in collective agent based systems. Artificial Intelligence 142: 121\u2013145","journal-title":"Artificial Intelligence"},{"issue":"3","key":"9086_CR55","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H. Topcuouglu","year":"2002","unstructured":"Topcuouglu H., Hariri S., Wu M.Y. (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13(3): 260\u2013274. doi: 10.1109\/71.993206","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"9086_CR56","doi-asserted-by":"crossref","unstructured":"Tr\u00fcg, S., Hoffmann, J., & Nebel, B. (2004). Applying automatic planning systems to airport ground-traffic control\u2014a feasibility study. In KI (pp. 183\u2013197).","DOI":"10.1007\/978-3-540-30221-6_15"},{"key":"9086_CR57","doi-asserted-by":"crossref","unstructured":"von Martial, F. (1992). Coordinating plans of autonomous agents. Lecture Notes on Artificial Intelligence (vol. 610). Berlin: Springer-Verlag.","DOI":"10.1007\/BFb0016366"},{"key":"9086_CR58","doi-asserted-by":"crossref","unstructured":"Walsh, W., Wellman, M., Wurman, P., & MacKie-Mason, J. (1998). Some economics of market-based distributed scheduling. In Proceedings of 18th international conference on distributed computing systems (pp. 612\u2013621).doi: 10.1109\/ICDCS.1998.679848 .","DOI":"10.1109\/ICDCS.1998.679848"},{"key":"9086_CR59","unstructured":"Yadati, C., Witteveen, C., Zhang, Y., Wu, M., & Putre, H. L. (2008). Autonomous scheduling. In Proceedings of the FCS 2008 (pp. 73\u201379)."},{"key":"9086_CR60","unstructured":"Zutt, J., & Witteveen, C. (2006). Operational transport planning with incidents, experiments with traplas. In H. J. van Zuylen (Ed.), Proceedings of the 9th TRAIL congress (TRAIL\u201906)."}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-009-9086-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T10:00:59Z","timestamp":1550570459000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-009-9086-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,8]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9086"],"URL":"https:\/\/doi.org\/10.1007\/s10458-009-9086-9","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,8]]}}}