{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T08:22:51Z","timestamp":1760170971536},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FWO"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Auton Agent Multi-Agent Syst"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10458-015-9313-5","type":"journal-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T10:20:28Z","timestamp":1446546028000},"page":"66-106","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Exact and heuristic methods for solving Boolean games"],"prefix":"10.1007","volume":"31","author":[{"given":"Sofie","family":"De Clercq","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim","family":"Bauters","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Schockaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihail","family":"Mihaylov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ann","family":"Now\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martine","family":"De Cock","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"9313_CR1","unstructured":"\u00c5gotnes, T., Harrenstein, P., van der Hoek, W., & Wooldridge, M. (2013). Verifiable equilibria in Boolean games. In Proceedings of IJCAI (pp. 689\u2013695)."},{"issue":"2","key":"9313_CR2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.2140\/pjm.1960.10.381","volume":"10","author":"R Aumann","year":"1960","unstructured":"Aumann, R. (1960). Acceptable points in games of perfect information. Pacific Journal of Mathematics, 10(2), 381\u2013417.","journal-title":"Pacific Journal of Mathematics"},{"key":"9313_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge representation, reasoning and declarative problem solving","author":"C Baral","year":"2003","unstructured":"Baral, C. (2003). Knowledge representation, reasoning and declarative problem solving. New York: Cambridge University Press."},{"key":"9313_CR4","unstructured":"Ben-Naim, J., & Lorini, E. (2014). Evaluating power of agents from dependence relations in boolean games. In Proceedings of AAMAS (pp. 853\u2013860)."},{"key":"9313_CR5","doi-asserted-by":"crossref","unstructured":"Bonzon, E., Lagasquie-Schiex, M. C., & Lang, J. (2007). Dependencies between players in Boolean games. In Proceedings of ECSQARU, pp. 743\u2013754. Springer, Berlin.","DOI":"10.1007\/978-3-540-75256-1_65"},{"issue":"6","key":"9313_CR6","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1016\/j.ijar.2009.02.008","volume":"50","author":"E Bonzon","year":"2009","unstructured":"Bonzon, E., Lagasquie-Schiex, M. C., & Lang, J. (2009). Dependencies between players in Boolean games. International Journal of Approximate Reasoning, 50(6), 899\u2013914.","journal-title":"International Journal of Approximate Reasoning"},{"key":"9313_CR7","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s11229-012-0130-y","volume":"187","author":"E Bonzon","year":"2012","unstructured":"Bonzon, E., Lagasquie-Schiex, M. C., & Lang, J. (2012). Effectivity functions and efficient coalitions in Boolean games. Synthese, 187, 73\u2013103.","journal-title":"Synthese"},{"key":"9313_CR8","unstructured":"Bonzon, E., Lagasquie-Schiex, M. C., Lang, J., & Zanuttini, B. (2006). Boolean games revisited. In Proceedings of ECAI (pp. 265\u2013269). ACM, New York."},{"issue":"1","key":"9313_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10458-008-9040-2","volume":"18","author":"E Bonzon","year":"2009","unstructured":"Bonzon, E., Lagasquie-Schiex, M. C., Lang, J., & Zanuttini, B. (2009). Compact preference representation and Boolean games. Autonomous Agents and Multi-Agent Systems, 18(1), 1\u201335.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"issue":"12","key":"9313_CR10","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., & Truszczy\u0144ski, M. (2011). Answer set programming at a glance. Communications of the ACM, 54(12), 92\u2013103.","journal-title":"Communications of the ACM"},{"key":"9313_CR11","unstructured":"De Clercq, S., Bauters, K., Schockaert, S., De Cock, M., & Now\u00e9, A. (2014). Using answer set programming for solving Boolean games. In Proceedings of KR (pp. 602\u2013605)."},{"key":"9313_CR12","unstructured":"De Clercq, S., Bauters, K., Schockaert, S., Mihaylov, M., De Cock, M., & Now\u00e9, A. (2014). Decentralized computation of Pareto optimal pure Nash equilibria of Boolean games with privacy concerns. In Proceedings of ICAART (pp. 50\u201359)."},{"key":"9313_CR13","unstructured":"De Clercq, S. (contact person). http:\/\/www.cwi.ugent.be\/BooleanGamesSolver.html ."},{"key":"9313_CR14","doi-asserted-by":"crossref","unstructured":"De Vos, M., & Vermeir, D. (1999). Choice logic programs and Nash equilibria in strategic games. In Proc. CSL (pp. 266\u2013276). Springer, Berlin.","DOI":"10.1007\/3-540-48168-0_19"},{"key":"9313_CR15","unstructured":"Dunne, P., van\u00a0der Hoek, W., Kraus, S., & Wooldridge, M. (2008). Cooperative Boolean games. In Proceedings of AAMAS (vol.\u00a02, pp. 1015\u20131022), IFAAMAS."},{"key":"9313_CR16","unstructured":"Dunne, P. E., & Wooldridge, M. (2012). Towards tractable Boolean games. In Proceedings of AAMAS (pp. 939\u2013946), IFAAMAS."},{"issue":"3\u20134","key":"9313_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter, T., & Gottlob, G. (1995). On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 15(3\u20134), 289\u2013323.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"9313_CR18","first-page":"21","volume":"2","author":"W Faber","year":"2005","unstructured":"Faber, W., Leone, N., & Ricca, F. (2005). Solving hard problems for the 2nd level of the Polynomial Hierarchy: Heuristics and benchmarks. Intelligenza Artificiale, 2(3), 21\u201328.","journal-title":"Intelligenza Artificiale"},{"key":"9313_CR19","unstructured":"Gelfond, M., & Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of ICLP\/SLP (pp. 1070\u20131080)."},{"issue":"3\u20134","key":"9313_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., & Lifschitz, V. (1991). Classical negation in logic programs and disjunctive databases. New Generation Computing, 9(3\u20134), 365\u2013385.","journal-title":"New Generation Computing"},{"key":"9313_CR21","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Greco, G., & Scarcello, F. (2003). Pure Nash equilibria: hard and easy games. In Proceedings of TARK (pp. 215\u2013230). ACM, New York.","DOI":"10.1145\/846241.846269"},{"key":"9313_CR22","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1613\/jair.1683","volume":"24","author":"G Gottlob","year":"2005","unstructured":"Gottlob, G., Greco, G., & Scarcello, F. (2005). Pure nash equilibria: Hard and easy games. Journal of Artificial Intelligence Research, 24, 357\u2013406.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9313_CR23","volume-title":"Introduction to probability","author":"C Grinstead","year":"1997","unstructured":"Grinstead, C., & Snell, J. (1997). Introduction to probability. New York: American Mathematical Society."},{"key":"9313_CR24","unstructured":"Harrenstein, P., van\u00a0der Hoek, W., Meyer, J. J., Witteveen, C. (2001). Boolean games. In Proceedings of TARK (pp. 287\u2013298). Morgan Kaufmann Publishers Inc., San Francisco."},{"key":"9313_CR25","unstructured":"Mihaylov, M. (2012). Decentralized coordination in multi-agent systems. Ph.D. thesis, Vrije Universiteit Brussel, Brussels."},{"issue":"5","key":"9313_CR26","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1007\/s10458-013-9240-2","volume":"28","author":"M Mihaylov","year":"2014","unstructured":"Mihaylov, M., Tuyls, K., & Now\u00e9, A. (2014). A decentralized approach for convention emergence in multi-agent systems. Autonomous Agents and Multi-Agent Systems, 28(5), 749\u2013778.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9313_CR27","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C. (1994). Computational complexity. Reading, MA: Addison-Wesley."},{"key":"9313_CR28","doi-asserted-by":"crossref","unstructured":"Sureka, A., & Wurman, P. R. (2005). Using tabu best-response search to find pure strategy Nash equilibria in normal form games. In Proceedings of AAMAS (pp. 1023\u20131029).","DOI":"10.1145\/1082473.1082628"},{"key":"9313_CR29","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. Artificial Intelligence, 195, 418\u2013439.","journal-title":"Artificial Intelligence"}],"container-title":["Autonomous Agents and Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-015-9313-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10458-015-9313-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-015-9313-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10458-015-9313-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T06:29:25Z","timestamp":1567319365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10458-015-9313-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9313"],"URL":"https:\/\/doi.org\/10.1007\/s10458-015-9313-5","relation":{},"ISSN":["1387-2532","1573-7454"],"issn-type":[{"value":"1387-2532","type":"print"},{"value":"1573-7454","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,3]]}}}