{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:40:03Z","timestamp":1749768003290,"version":"3.41.0"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319501260"},{"type":"electronic","value":"9783319501277"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50127-7_2","type":"book-chapter","created":{"date-parts":[[2016,11,29]],"date-time":"2016-11-29T01:04:06Z","timestamp":1480381446000},"page":"17-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Corrupt Strategic Argumentation: The Ideal and the Naive"],"prefix":"10.1007","author":[{"given":"Michael J.","family":"Maher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,29]]},"reference":[{"issue":"1\u20132","key":"2_CR1","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.artint.2005.05.006","volume":"168","author":"P Baroni","year":"2005","unstructured":"Baroni, P., Giacomin, M., Guida, G.: SCC-recursiveness: a general schema for argumentation semantics. Artif. Intell. 168(1\u20132), 162\u2013210 (2005)","journal-title":"Artif. Intell."},{"issue":"3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF00295861","volume":"6","author":"JJ Bartholdi","year":"1989","unstructured":"Bartholdi, J.J., Tovey, C.A., Trick, M.A.: The computational difficulty of manipulating an election. Soc. Choice Welf. 6(3), 227\u2013241 (1989)","journal-title":"Soc. Choice Welf."},{"key":"2_CR3","unstructured":"Baumann, R., Brewka, G.: Expanding argumentation frameworks: enforcing and monotonicity results. In: COMMA, pp. 75\u201386 (2010)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0004-3702(97)00015-5","volume":"93","author":"A Bondarenko","year":"1997","unstructured":"Bondarenko, A., Dung, P.M., Kowalski, R.A., Toni, F.: An abstract, argumentation-theoretic approach to default reasoning. Artif. Intell. 93, 63\u2013101 (1997)","journal-title":"Artif. Intell."},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Bonzon, E., Delobelle, J., Konieczny, S., Maudet, N.: A comparative study of ranking-based semantics for abstract argumentation. In: AAAI Conference on Artificial Intelligence, pp. 914\u2013920 (2016)","DOI":"10.1609\/aaai.v30i1.10116"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","volume":"77","author":"PM Dung","year":"1995","unstructured":"Dung, P.M.: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell. 77(2), 321\u2013358 (1995)","journal-title":"Artif. Intell."},{"issue":"10\u201315","key":"2_CR7","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","volume":"171","author":"PM Dung","year":"2007","unstructured":"Dung, P.M., Mancarella, P., Toni, F.: Computing ideal sceptical argumentation. Artif. Intell. 171(10\u201315), 642\u2013674 (2007). http:\/\/dx.doi.org\/10.1016\/j.artint.2007.05.003","journal-title":"Artif. Intell."},{"issue":"18","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1559","DOI":"10.1016\/j.artint.2009.09.001","volume":"173","author":"PE Dunne","year":"2009","unstructured":"Dunne, P.E.: The computational complexity of ideal semantics. Artif. Intell. 173(18), 1559\u20131591 (2009). http:\/\/dx.doi.org\/10.1016\/j.artint.2009.09.001","journal-title":"Artif. Intell."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.06.004","volume":"202","author":"PE Dunne","year":"2013","unstructured":"Dunne, P.E., Dvo\u0159\u00e1k, W., Woltran, S.: Parametric properties of ideal semantics. Artif. Intell. 202, 1\u201328 (2013). http:\/\/dx.doi.org\/10.1016\/j.artint.2013.06.004","journal-title":"Artif. Intell."},{"issue":"11","key":"2_CR10","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.ipl.2010.04.005","volume":"110","author":"W Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k, W., Woltran, S.: Complexity of semi-stable and stage semantics in argumentation frameworks. Inf. Process. Lett. 110(11), 425\u2013430 (2010). http:\/\/dx.doi.org\/10.1016\/j.ipl.2010.04.005","journal-title":"Inf. Process. Lett."},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M.: Strategic argumentation is NP-complete. In: Proceedings of European Conference on Artificial Intelligence, pp. 399\u2013404 (2014)","DOI":"10.3233\/978-1-61499-419-0-399"},{"key":"2_CR12","series-title":"Algorithms and Complexity","first-page":"67","volume-title":"Handbook of Theoretical Computer Science","author":"DS Johnson","year":"1990","unstructured":"Johnson, D.S.: A catalog of complexity classes. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Algorithms and Complexity, vol. A, pp. 67\u2013161. Elsevier, Amsterdam (1990)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Complexity of exploiting privacy violations in strategic argumentation. In: Proc. Pacific Rim International Conf. on Artificial Intelligence. pp. 523\u2013535 (2014)","DOI":"10.1007\/978-3-319-13560-1_42"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Resistance to corruption of general strategic argumentation. In: Proceedings of International Conference Principles and Practice of Multi-Agent Systems, pp. 61\u201375 (2016)","DOI":"10.1007\/978-3-319-44832-9_4"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Resistance to corruption of strategic argumentation. In: AAAI Conference on Artificial Intelligence, pp. 1030\u20131036 (2016)","DOI":"10.1609\/aaai.v30i1.10090"},{"key":"2_CR16","unstructured":"Rahwan, I., Larson, K., Tohm\u00e9, F.A.: A characterisation of strategy-proofness for grounded argumentation semantics. In: Boutilier, C. (ed.) IJCAI, pp. 251\u2013256 (2009)"},{"key":"2_CR17","unstructured":"Verheij, B.: Two approaches to dialectical argumentation: admissible sets and argumentation stages. In: Proceedings of the 8th Dutch Conference on Artificial Intelligence, pp. 357\u2013368 (1996)"}],"container-title":["Lecture Notes in Computer Science","AI 2016: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50127-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T22:25:29Z","timestamp":1749767129000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-50127-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319501260","9783319501277"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50127-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"29 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Joint Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hobart, TAS","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ausai2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ai2016.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}