{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:14:18Z","timestamp":1725491658163},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749486"},{"type":"electronic","value":"9783540749493"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74949-3_12","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T01:46:18Z","timestamp":1190166378000},"page":"133-144","source":"Crossref","is-referenced-by-count":5,"title":["Coordinating Competitive Agents in Dynamic Airport Resource Scheduling"],"prefix":"10.1007","author":[{"given":"Xiaoyu","family":"Mao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriaan","family":"ter Mors","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nico","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cees","family":"Witteveen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1017\/S0269888900001089","volume":"15","author":"D.E. Smith","year":"2000","unstructured":"Smith, D.E., Frank, J., J\u00f3nsson, A.K.: Bridging the gap between planning and scheduling. Knowl. Eng. Rev.\u00a015(1), 47\u201383 (2000)","journal-title":"Knowl. Eng. Rev."},{"key":"12_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1145\/301250.301287","volume-title":"STOC 1999","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC 1999. Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pp. 129\u2013140. ACM Press, New York (1999)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-540-31856-9_6","volume-title":"STACS 2005","author":"N. Andelman","year":"2005","unstructured":"Andelman, N., Azar, Y., Sorani, M.: Truthful approximation mechanisms for scheduling selfish related machines. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, pp. 69\u201382. Springer, Heidelberg (2005)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1007\/978-3-540-24749-4_53","volume-title":"STACS 2004","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., Prisco, R.D., Penna, P., Persiano, G.: Deterministic truthful approximation mechanisms for scheduling related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 608\u2013619. Springer, Heidelberg (2004)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/11561071_55","volume-title":"Algorithms \u2013 ESA 2005","author":"A. Kov\u00e1cs","year":"2005","unstructured":"Kov\u00e1cs, A.: Fast monotone 3-approximation algorithm for scheduling related machines. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol.\u00a03669, pp. 616\u2013627. Springer, Heidelberg (2005)"},{"issue":"1-3","key":"12_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.tcs.2006.07.057","volume":"369","author":"E. Angel","year":"2006","unstructured":"Angel, E., Bampis, E., Pascual, F.: Truthful algorithms for scheduling selfish tasks on parallel machines. Theor. Comput. Sci.\u00a0369(1-3), 157\u2013168 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/11600930_7","volume-title":"Internet and Network Economics","author":"N. Immorlica","year":"2005","unstructured":"Immorlica, N., Li, L., Mirrokni, V.S., Schulz, A.: Coordination mechanisms for selfish scheduling. In: Deng, X., Ye, Y. (eds.) WINE 2005. LNCS, vol.\u00a03828, pp. 55\u201369. Springer, Heidelberg (2005)"},{"key":"12_CR8","unstructured":"Vermeulen, I., Bohte, S., Somefun, D., Poutr\u00e9, J.L.: Improving patient schedules by multi-agent pareto appointment exchanging. In: CEC\/EEE 2006. Proceedings of 2006 IEEE International Conference on E-Commerce Technology, San Francisco, California, p. 9 (June 26-29, 2006)"},{"key":"12_CR9","first-page":"1224","volume-title":"IJCIA 2003","author":"T.O. Paulussen","year":"2003","unstructured":"Paulussen, T.O., Jennings, N.R., Decker, K.S., Heinzl, A.: Distributed patient scheduling in hospitals. In: IJCIA 2003, pp. 1224\u20131232. Morgan Kaufmann, San Francisco (2003)"},{"issue":"9","key":"12_CR10","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.parco.2006.03.002","volume":"32","author":"A. Attanasio","year":"2006","unstructured":"Attanasio, A., Ghiani, G., Grandinetti, L., Guerriero, F.: Auction algorithms for decentralized parallel machine scheduling. Parallel Comput.\u00a032(9), 701\u2013709 (2006)","journal-title":"Parallel Comput."},{"key":"12_CR11","unstructured":"Lewin, R.: Embracing Complexity: Exploring the Application of Complex Adaptive Systems to Business. Ernst & Young (1996)"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/375735.375866","volume-title":"Proceedings of the Fifth International Conference on Autonomous Agents","author":"D.C. Parkes","year":"2001","unstructured":"Parkes, D.C., Ungar, L.H.: An auction-based method for decentralized train scheduling. In: Proceedings of the Fifth International Conference on Autonomous Agents, Montreal, Canada, pp. 43\u201350. ACM Press, New York (2001)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1010","DOI":"10.1145\/860575.860770","volume-title":"AAMAS 2003","author":"P.J. \u2019t Hoen","year":"2003","unstructured":"\u2019t Hoen, P.J., Poutre, J.A.L.: A decommitment strategy in a competitive multi-agent transportation setting. In: AAMAS 2003, pp. 1010\u20131011. ACM Press, New York (2003)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/game.2000.0831","volume":"25","author":"T. Sandholm","year":"2001","unstructured":"Sandholm, T., Lesser, V.: Leveled commitment contracts and strategic breach. Games and Economic Behaviour\u00a025, 212\u2013270 (2001)","journal-title":"Games and Economic Behaviour"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1145\/301136.301229","volume-title":"Agents 1999","author":"J. Collins","year":"1999","unstructured":"Collins, J., Tsvetovas, M., Sundareswara, R., van Tonder, J., Gini, M., Mobasher, B.: Evaluating risk: flexibility and feasibility in multi-agent contracting. In: Agents 1999. Proceedings of the Third International Conference on Autonomous Agents, Seattle, WA, USA, pp. 350\u2013351. ACM Press, Seattle, WA (1999)"}],"container-title":["Lecture Notes in Computer Science","Multiagent System Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74949-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T17:03:10Z","timestamp":1550941390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74949-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540749486","9783540749493"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74949-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}