{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:56:32Z","timestamp":1760709392091,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T00:00:00Z","timestamp":1502755200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10489-017-1046-5","type":"journal-article","created":{"date-parts":[[2017,8,15]],"date-time":"2017-08-15T00:33:35Z","timestamp":1502757215000},"page":"1020-1040","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["A better-response strategy for self-interested planning agents"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0400-9136","authenticated-orcid":false,"given":"Jaume","family":"Jord\u00e1n","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Torre\u00f1o","sequence":"additional","affiliation":[]},{"given":"Mathijs","family":"de Weerdt","sequence":"additional","affiliation":[]},{"given":"Eva","family":"Onaindia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,15]]},"reference":[{"key":"1046_CR1","doi-asserted-by":"crossref","unstructured":"Aghighi M, B\u00e4ckstr\u00f6m C (2016) A multi-parameter complexity analysis of cost-optimal and net-benefit planning. In: Proceedings of the Twenty-Sixth International Conference on International Conference on Automated Planning and Scheduling. AAAI Press, London, pp 2\u201310","DOI":"10.1609\/icaps.v26i1.13738"},{"key":"1046_CR2","unstructured":"Bercher P, Mattm\u00fcller R (2008) A planning graph heuristic for forward-chaining adversarial planning. In: ECAI, vol 8, pp 921\u2013922"},{"key":"1046_CR3","unstructured":"Brafman RI, Domshlak C, Engel Y, Tennenholtz M (2009) Planning games. In: IJCAI 2009, Proceedings of the 21st international joint conference on artificial intelligence, pp 73\u201378"},{"issue":"1","key":"1046_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander T (1994) The computational complexity of propositional strips planning. Artif Intell 69(1):165\u2013204","journal-title":"Artif Intell"},{"key":"1046_CR5","doi-asserted-by":"crossref","unstructured":"Chen X, Deng X (2006) Settling the complexity of two-player nash equilibrium. In: 47th annual IEEE symposium on foundations of computer science, 2006. FOCS\u201906. IEEE, pp 261\u2013272","DOI":"10.1109\/FOCS.2006.69"},{"issue":"2","key":"1046_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.geb.2009.05.004","volume":"71","author":"S Chien","year":"2011","unstructured":"Chien S, Sinclair A (2011) Convergence to approximate nash equilibria in congestion games. Games and Economic Behavior 71(2):315\u2013327","journal-title":"Games and Economic Behavior"},{"key":"1046_CR7","unstructured":"de Cote EM, Chapman A, Sykulski AM, Jennings N (2010) Automated planning in repeated adversarial games. In: 26th conference on uncertainty in artificial intelligence (UAI 2010), pp 376\u2013383"},{"issue":"1","key":"1046_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.artint.2009.09.005","volume":"174","author":"PE Dunne","year":"2010","unstructured":"Dunne PE, Kraus S, Manisterski E, Wooldridge M (2010) Solving coalitional resource games. Artif Intell 174(1):20\u201350","journal-title":"Artif Intell"},{"key":"1046_CR9","doi-asserted-by":"crossref","unstructured":"Fabrikant A, Papadimitriou C, Talwar K (2004) The complexity of pure nash equilibria. In: Proceedings of the thirty-sixth annual ACM symposium on theory of computing, STOC \u201904, pp 604\u2013612","DOI":"10.1145\/1007352.1007445"},{"issue":"1","key":"1046_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/jeth.2000.2694","volume":"98","author":"JW Friedman","year":"2001","unstructured":"Friedman JW, Mezzetti C (2001) Learning in games by random sampling. J Econ Theory 98(1):55\u201384","journal-title":"J Econ Theory"},{"key":"1046_CR11","doi-asserted-by":"crossref","unstructured":"Ghallab M, Nau D, Traverso P (2004) Automated planning: theory & practice. Elsevier","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"1046_CR12","doi-asserted-by":"crossref","unstructured":"Goemans M, Mirrokni V, Vetta A (2005) Sink equilibria and convergence. In: Proceedings of the 46th annual IEEE symposium on foundations of computer science, FOCS \u201905, pp 142\u2013154","DOI":"10.1109\/SFCS.2005.68"},{"issue":"3","key":"1046_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10472-013-9363-9","volume":"69","author":"M Hadad","year":"2013","unstructured":"Hadad M, Kraus S, Hartman IBA, Rosenfeld A (2013) Group planning with time constraints. Ann Math Artif Intell 69(3):243\u2013291","journal-title":"Ann Math Artif Intell"},{"issue":"1","key":"1046_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.geb.2007.12.002","volume":"69","author":"S Hart","year":"2010","unstructured":"Hart S, Mansour Y (2010) How long to equilibrium? the communication complexity of uncoupled equilibrium procedures. Games and Economic Behavior 69(1):107\u2013126","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"1046_CR15","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0004-3702(02)00364-8","volume":"143","author":"M Helmert","year":"2003","unstructured":"Helmert M (2003) Complexity results for standard benchmark domains in planning. Artif Intell 143(2):219\u2013262","journal-title":"Artif Intell"},{"issue":"1","key":"1046_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert M (2006) The fast downward planning system. J Artif Intell Res 26(1):191\u2013246","journal-title":"J Artif Intell Res"},{"issue":"2","key":"1046_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1008746126376","volume":"10","author":"N Jennings","year":"2001","unstructured":"Jennings N, Faratin P, Lomuscio A, Parsons S, Wooldrige M, Sierra C (2001) Automated negotiation: prospects, methods and challenges. Group Decis Negot 10(2):199\u2013215","journal-title":"Group Decis Negot"},{"issue":"1","key":"1046_CR18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"DS Johnson","year":"1988","unstructured":"Johnson DS, Papadimtriou CH, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37 (1):79\u2013100","journal-title":"J Comput Syst Sci"},{"key":"1046_CR19","doi-asserted-by":"crossref","unstructured":"Jonsson A, Rovatsos M (2011) Scaling up multiagent planning: a best-response approach. In: Proceedings of the 21st international conference on automated planning and scheduling, ICAPS","DOI":"10.1609\/icaps.v21i1.13461"},{"key":"1046_CR20","doi-asserted-by":"crossref","unstructured":"Jord\u00e1n J, Onaind\u00eda E (2015) Game-theoretic approach for non-cooperative planning. In: 29th AAAI conference on artificial intelligence (AAAI-15), pp 1357\u20131363","DOI":"10.1609\/aaai.v29i1.9384"},{"key":"1046_CR21","unstructured":"McDermott D, Ghallab M, Howe A, Knoblock C, Ram A, Veloso M, Weld D, Wilkins D (1998) PDDL: the planning domain definition language. Yale Center for Computational Vision and Control, New Haven"},{"issue":"1","key":"1046_CR22","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich I (1996) Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1):111\u2013124","journal-title":"Games and Economic Behavior"},{"issue":"1","key":"1046_CR23","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer D, Shapley LS (1996) Potential games. Games and Economic Behavior 14(1):124\u2013143","journal-title":"Games and Economic Behavior"},{"key":"1046_CR24","unstructured":"Nigro N, Welch D, Peace J (2015) Strategic planning to implement publicly available ev charching stations: a guide for business and policy makers. Tech rep, Center for Climate and Energy Solutions"},{"issue":"1","key":"1046_CR25","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1613\/jair.2046","volume":"29","author":"N Nisan","year":"2007","unstructured":"Nisan N, Ronen A (2007) Computationally feasible vcg mechanisms. J Artif Intell Res 29(1):19\u201347","journal-title":"J Artif Intell Res"},{"key":"1046_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani VV (2007) Algorithmic game theory. Cambridge University Press, New York"},{"issue":"3","key":"1046_CR27","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"CH Papadimitriou","year":"1994","unstructured":"Papadimitriou CH (1994) On the complexity of the parity argument and other inefficient proofs of existence. J Comput Syst Sci 48(3):498\u2013532","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"1046_CR28","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39(1):127\u2013177","journal-title":"J Artif Intell Res"},{"issue":"1","key":"1046_CR29","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal RW (1973) A class of games possessing pure-strategy nash equilibria. Int J Game Theory 2(1):65\u201367","journal-title":"Int J Game Theory"},{"key":"1046_CR30","doi-asserted-by":"crossref","unstructured":"Shoham Y, Leyton-Brown K (2009) Multiagent systems: algorithmic, game-theoretic, and logical foundations. Cambridge University Press","DOI":"10.1017\/CBO9780511811654"},{"issue":"1","key":"1046_CR31","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10115-012-0569-7","volume":"38","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o A, Onaindia E, Sapena \u00d3 (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141\u2013178","journal-title":"Knowl Inf Syst"},{"issue":"2","key":"1046_CR32","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/s10489-014-0540-2","volume":"41","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o A, Onaindia E, Sapena \u00d3 (2014) FMAP: distributed cooperative multi-agent planning. Appl Intell 41(2):606\u2013 626","journal-title":"Appl Intell"},{"key":"1046_CR33","doi-asserted-by":"crossref","unstructured":"Torre\u00f1o A, Sapena \u00d3, Onaindia E (2015) Global heuristics for distributed cooperative multi-agent planning. In: ICAPS 2015. 25th international conference on automated planning and scheduling. AAAI Press, pp 225\u2013233","DOI":"10.1609\/icaps.v25i1.13701"},{"key":"1046_CR34","unstructured":"Von Neumann J, Morgenstern O (2007) Theory of games and economic behavior. Princeton University Press"},{"issue":"1","key":"1046_CR35","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1023\/A:1020236119243","volume":"37","author":"M Weerdt de","year":"2003","unstructured":"de Weerdt M, Bos A, Tonino H, Witteveen C (2003) A resource logic for multi-agent plan merging. Ann Math Artif Intell 37(1):93\u2013130","journal-title":"Ann Math Artif Intell"},{"key":"1046_CR36","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.artint.2012.11.003","volume":"195","author":"M Wooldridge","year":"2013","unstructured":"Wooldridge M, Endriss U, Kraus S, Lang J (2013) Incentive engineering for boolean games. Artif Intell 195:418\u2013439","journal-title":"Artif Intell"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-017-1046-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1046-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-017-1046-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,25]],"date-time":"2023-08-25T02:19:58Z","timestamp":1692929998000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-017-1046-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,15]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["1046"],"URL":"https:\/\/doi.org\/10.1007\/s10489-017-1046-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2017,8,15]]}}}