{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:06:45Z","timestamp":1751861205379},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T00:00:00Z","timestamp":1566259200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"The Lynn and William Frankel Center for Computer Sciences at Ben-Gurion University"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10601-019-09304-y","type":"journal-article","created":{"date-parts":[[2019,8,20]],"date-time":"2019-08-20T05:02:27Z","timestamp":1566277347000},"page":"288-319","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Incentive-based search for equilibria in boolean games"],"prefix":"10.1007","volume":"24","author":[{"given":"Vadim","family":"Levit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zohar","family":"Komarovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tal","family":"Grinshpoun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ana L. C.","family":"Bazzan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Meisels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,20]]},"reference":[{"issue":"4","key":"9304_CR1","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J., Tardos, E., Wexler, T., Roughgarden, T. (2008). The price of stability for network design with fair cost allocation. SIAM Journal on Computing, 38(4), 1602\u20131623.","journal-title":"SIAM Journal on Computing"},{"issue":"5439","key":"9304_CR2","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., & Albert, R. (1999). Emergence of scaling in random networks. Science, 286(5439), 509\u2013512.","journal-title":"Science"},{"issue":"6","key":"9304_CR3","doi-asserted-by":"publisher","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. Int. J. Approx. Reasoning, 50(6), 899\u2013914.","journal-title":"Int. J. Approx. Reasoning"},{"key":"9304_CR4","unstructured":"Bonzon, E., Lagasquie-Schiex, M.-C., Lang, J., Zanuttini, B. (2006). Boolean games revisited. In: 17th Euro. Conf. Artif. Intell. - ECAI, pp. 265\u2013269, Riva del Garda, Italy."},{"key":"9304_CR5","doi-asserted-by":"publisher","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\u201335.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9304_CR6","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C Boutilier","year":"2003","unstructured":"Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D. (2003). CP-Nets: A tool for representing and reasoning with conditional Ceteris Paribus preference statements. Journal of Artificial Intelligence Research, 21, 135\u2013191.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1","key":"9304_CR7","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/s10458-015-9313-5","volume":"31","author":"S De Clercq","year":"2017","unstructured":"De Clercq, S., Bauters, K., Schockaert, S., Mihaylov, M., Now\u0117, A., De Cock, M. (2017). Exact and heuristic methods for solving boolean games. Autonomous Agents and Multi-Agent Systems, 31(1), 66\u2013106.","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"9304_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511609428","volume-title":"Coordination games","author":"R Cooper","year":"1999","unstructured":"Cooper, R. (1999). Coordination games. Cambridge: Cambridge University Press."},{"key":"9304_CR9","unstructured":"Cordes, J.J. (1999). Horizontal equity. In: The encyclopedia of taxation and tax policy. Urban Institute Press."},{"key":"9304_CR10","unstructured":"De Clercq, S., Bauters, K., Schockaert, S., De Cock, M., Now\u00e9, A. (2014). Using answer set programming for solving Boolean games. In: 14th Intern. Conf. Princip. Knowl. Represent. Reason. (KR), Vienna, Austria."},{"key":"9304_CR11","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: ICAART, pp. 50\u201359."},{"key":"9304_CR12","doi-asserted-by":"crossref","unstructured":"Dunne, P.E., & van der Hoek, W. (2004). Representation and complexity in boolean games. In: European workshop on logics in artificial intelligence, pp. 347\u2013359. Springer.","DOI":"10.1007\/978-3-540-30227-8_30"},{"key":"9304_CR13","unstructured":"Dunne, P.E., van der Hoek, W., Kraus, S., Wooldridge, M. (2008). Cooperative Boolean games. In: 7th Intern. Conf. Auton. Agents Multi Agent Sys. (AAMAS-08), pp. 1015\u20131022, Estoril, Portugal."},{"key":"9304_CR14","unstructured":"Dunne, P.E., & Wooldridge, M. (2012). Towards tractable Boolean games. In: 11th Intern. Conf. Auton. Agents Multi Agent Sys. (AAMAS-2012), pages 939\u2013946, Valencia, Spain."},{"key":"9304_CR15","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdo\u0307s","year":"1959","unstructured":"Erdo\u0307s, P., & R\u00e9nyi, A. (1959). On random graphs. Publicationes Mathematicae Debrecen, 6, 290\u2013297.","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"9304_CR16","doi-asserted-by":"publisher","first-page":"373","DOI":"10.2307\/2090664","volume":"26","author":"WA Gamson","year":"1961","unstructured":"Gamson, W.A. (1961). A theory of coalition formation. American Sociological Review, 26, 373\u2013382.","journal-title":"American Sociological Review"},{"key":"9304_CR17","unstructured":"Gershman, A., Grubshtein, A., Meisels, A., Rokach, L., Zivan, R. (2008). Scheduling meetings by agents. In: Proc. 7th Intern. Conf. on Pract. & Theo. Automated Timetabling (PATAT 2008), Montreal."},{"issue":"2","key":"9304_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s11225-014-9544-5","volume":"102","author":"J Grant","year":"2014","unstructured":"Grant, J., Kraus, S., Wooldridge, M., Zuckerman, I. (2014). Manipulating games by sharing information. Studia Logica, 102(2), 267\u2013295.","journal-title":"Studia Logica"},{"key":"9304_CR19","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1613\/jair.3945","volume":"47","author":"T Grinshpoun","year":"2013","unstructured":"Grinshpoun, T., Grubshtein, A., Zivan, R., Netzer, A., Meisels, A. (2013). Asymmetric distributed constraint optimization problems. Journal of Artificial Intelligence Research, 47, 613\u2013647.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9304_CR20","unstructured":"Grubshtein, A., & Meisels, A. (2012). A distributed cooperative approach for optimizing a family of network games. In: Intelligent distributed computing V - proceedings of the 5th international symposium on intelligent distributed computing - IDC 2011, Delft, The Netherlands - October 2011, volume 382 of Studies in Computational Intelligence, pp. 49\u201362. Springer."},{"key":"9304_CR21","doi-asserted-by":"crossref","unstructured":"Grubshtein, A., & Meisels, A. (2012). Finding a nash equilibrium by asynchronous backtracking. In: Principles and practice of constraint programming - 18th international conference, CP 2012, qu\u0117bec City, QC, Canada, October 8-12, 2012. Proceedings, pp. 925\u2013940.","DOI":"10.1007\/978-3-642-33558-7_66"},{"key":"9304_CR22","unstructured":"Harrenstein, P., Turrini, P., Wooldridge, M. (2014). Hard and soft equilibria in Boolean games. In: 13th Intern. Conf. Auton. Agents Multi Agent Sys. (AAMAS-2014), pages 845\u2013852, Paris, France."},{"key":"9304_CR23","unstructured":"Harrenstein, P., van der Hoek, W., Meyer, J.-J., Witteveen, C. (2001). Boolean games. In: TARK, pp. 287\u2013298."},{"key":"9304_CR24","doi-asserted-by":"crossref","unstructured":"Hirayama, K., & Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In: CP, pp. 222\u2013236.","DOI":"10.1007\/BFb0017442"},{"issue":"2","key":"9304_CR25","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1111\/j.1467-937X.2005.00342.x","volume":"72","author":"MO Jackson","year":"2005","unstructured":"Jackson, M.O., & Wilkie, S. (2005). Endogenous games and mechanisms: Side payments among players. The Review of Economic Studies, 72(2), 543\u2013566.","journal-title":"The Review of Economic Studies"},{"key":"9304_CR26","doi-asserted-by":"crossref","unstructured":"Kun, J., Powers, B., Reyzin, L. (2013). Anti-coordination games and stable graph colorings. In: SAGT, pp. 122\u2013133.","DOI":"10.1007\/978-3-642-41392-6_11"},{"key":"9304_CR27","unstructured":"L\u0117aut\u0117, T., & Faltings, B. (2011). Distributed constraint optimization under stochastic uncertainty. In: Proceedings of the 25th AAAI conference on artificial intelligence, AAAI San Francisco, California, USA, August 7-11, 2011,."},{"key":"9304_CR28","doi-asserted-by":"crossref","unstructured":"Levit, V., Grinshpoun, T., Meisels, A. (2013). Boolean games for charging electric vehicles. In: IAT, pp 86\u201393.","DOI":"10.1109\/WI-IAT.2013.95"},{"key":"9304_CR29","unstructured":"Levit, V., Grinshpoun, T., Meisels, A., Bazzan, A.L.C. (2013). Taxation search in boolean games. In: 12th Intern. Conf. Auton. Agents Multi-Agent Sys. (AAMAS-13), pp. 183\u2013190, Saint Paul, MN, USA."},{"key":"9304_CR30","unstructured":"Levit, V., Komarovsky, Z., Grinshpoun, T., Meisels, A. (2015). Tradeoffs between incentive mechanisms in boolean games. In: 24th Intern. Joint Conf. on Artif. Intell. (IJCAI-2015), pp 68\u201374, Buenos Aires, Argentina."},{"key":"9304_CR31","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.artint.2017.07.003","volume":"252","author":"O Litov","year":"2017","unstructured":"Litov, O., & Meisels, A. (2017). Forward bounding on pseudo-trees for dcops and adcops. Artificial Intelligence, 252, 83\u201399.","journal-title":"Artificial Intelligence"},{"key":"9304_CR32","unstructured":"Lynch, N.A. (1997). Distributed algorithms. Morgan kaufmann Series."},{"key":"9304_CR33","doi-asserted-by":"crossref","unstructured":"Mavronicolas, M., Monien, B., Wagner, K.W. (2007). Weighted Boolean formula games. In: WINE, pp. 469\u2013481.","DOI":"10.1007\/978-3-540-77105-0_51"},{"key":"9304_CR34","unstructured":"Meisels, A., Razgon, I., Kaplansky, E., Zivan, R. (2002). Comparing performance of distributed constraints processing algorithms. In: Proc. AAMAS-2002 workshop on distributed constraint reasoning DCR, pp. 86\u201393, Bologna."},{"key":"9304_CR35","unstructured":"Meisels, A. (2007). Distributed search by constrained agents: Algorithms, performance, Communication. Springer Verlag."},{"key":"9304_CR36","unstructured":"Modi, J., & Veloso, M. (2004). Multiagent meeting scheduling with rescheduling. In: Proc. 5th workshop on distributed constraints reasoning DCR-04, Toronto."},{"key":"9304_CR37","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.artint.2004.09.003","volume":"161","author":"PJ Modi","year":"2005","unstructured":"Modi, P.J., Shen, W., Tambe, M., Yokoo, M. (2005). ADOPT: Asynchronous distributed constraints optimization with quality guarantees. Artificial Intelligence, 161, 11\u20132:49\u2013180.","journal-title":"Artificial Intelligence"},{"key":"9304_CR38","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1613\/jair.1231","volume":"21","author":"D Monderer","year":"2004","unstructured":"Monderer, D., & Tennenholtz, M. (2004). k-implementation. Journal of Artificial Intelligence Research, 21, 37\u201362.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"9304_CR39","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.artint.2012.09.002","volume":"193","author":"A Netzer","year":"2012","unstructured":"Netzer, A., Grubshtein, A., Meisels, A. (2012). Concurrent forward bounding for distributed constraint optimization problems. Artif Intell., 193, 186\u2013216.","journal-title":"Artif Intell."},{"key":"9304_CR40","unstructured":"Nguyen T.-V.-A., & Lallouet, A. (2014). A complete solver for constraint games. In: Principles and practice of constraint programming - 20th international conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings, pp. 58\u201374."},{"key":"9304_CR41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic game theory","author":"N Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T, Tardos, E., Vazirani, V.V. (2007). Algorithmic game theory. Cambridge: Cambridge University Press."},{"key":"9304_CR42","unstructured":"Osborne, M., & Rubinstein, A. (1994). A course in game theory. The MIT Press."},{"key":"9304_CR43","unstructured":"Papadimitriou, C.H. (1994). Computational complexity. Addison-Wesley."},{"issue":"2","key":"9304_CR44","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.geb.2006.03.015","volume":"63","author":"Ryan Porter","year":"2008","unstructured":"Porter, Ryan, Nudelman, Eugene, Shoham, Yoav. (2008). Simple search methods for finding a nash equilibrium. Games and Economic Behavior, 63(2), 642\u2013662.","journal-title":"Games and Economic Behavior"},{"key":"9304_CR45","unstructured":"Roughgarden, T. (2005). Selfish routing and the price of anarchy. The MIT press."},{"issue":"2","key":"9304_CR46","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1093\/logcom\/exr030","volume":"23","author":"Luigi Sauro","year":"2013","unstructured":"Sauro, Luigi, & Villata, Serena. (2013). Dependency in cooperative Boolean games. Journal of Logic and Computation, 23(2), 425\u2013444.","journal-title":"Journal of Logic and Computation"},{"key":"9304_CR47","unstructured":"Turrini, P. (2013). Endogenous Boolean games. In: 24th Intern. Joint Conf. on Artif. Intell. (IJCAI-2013), pp. 390\u2013396, Beijing, China."},{"key":"9304_CR48","doi-asserted-by":"publisher","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"},{"key":"9304_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2004.10.004","volume":"161","author":"W Zhang","year":"2005","unstructured":"Zhang, W., Xing, Z., Wang, G., Wittenburg, L. (2005). Distributed stochastic search and distributed breakout: properties, comparishon and applications to constraints optimization problems in sensor networks. Artificial Intelligence, 161, 1\u20132:55\u201388.","journal-title":"Artificial Intelligence"},{"key":"9304_CR50","unstructured":"Zivan, R., & Meisels, A. (2005). Dynamic ordering for asynchronous backtracking on discsps. In: CP-2005, pages 32\u201346, Sigtes (Barcelona), Spain."},{"key":"9304_CR51","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.artint.2005.12.005","volume":"170","author":"R Zivan","year":"2006","unstructured":"Zivan, R., & Meisels, A. (2006). Concurrent search for distributed csps. Artificial Intelligence, 170, 440\u2013461.","journal-title":"Artificial Intelligence"},{"key":"9304_CR52","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10472-006-9033-2","volume":"46","author":"R Zivan","year":"2006","unstructured":"Zivan, R., & Meisels, A. (2006). Message delay and disCSP search algorithms. Annals of Mathematics and Artificial Intelligence (AMAI), 46, 415\u2013439.","journal-title":"Annals of Mathematics and Artificial Intelligence (AMAI)"},{"key":"9304_CR53","doi-asserted-by":"crossref","unstructured":"Zivan, R., Glinton, R., Sycara, K.P. (2009). Distributed constraint optimization for large teams of mobile sensing agents. In: Proceedings of the 2009 IEEE\/WIC\/ACM international conference on intelligent agent technology, IAT 2009, Milan, Italy, 15-18 September 2009, pp. 347\u2013354.","DOI":"10.1109\/WI-IAT.2009.176"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-019-09304-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-019-09304-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-019-09304-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T07:47:53Z","timestamp":1695109673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-019-09304-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,20]]},"references-count":53,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9304"],"URL":"https:\/\/doi.org\/10.1007\/s10601-019-09304-y","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,20]]},"assertion":[{"value":"20 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}