{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T04:06:37Z","timestamp":1751861197750,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983332"},{"type":"electronic","value":"9783319983349"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_45","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T12:33:14Z","timestamp":1534941194000},"page":"707-724","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Distributed Constrained Search by Selfish Agents for Efficient Equilibria"],"prefix":"10.1007","author":[{"given":"Vadim","family":"Levit","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amnon","family":"Meisels","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"45_CR1","volume-title":"A Course in Game Theory","author":"M Osborne","year":"1994","unstructured":"Osborne, M., Rubinstein, A.: A Course in Game Theory. The MIT Press, London (1994)"},{"issue":"6","key":"45_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1111\/j.1467-9779.2011.01523.x","volume":"13","author":"L DallAsta","year":"2011","unstructured":"DallAsta, L., Pin, P., Ramezanpour, A.: Optimal equilibria of the best shot game. J. Public Econ. Theory 13(6), 885\u2013901 (2011)","journal-title":"J. Public Econ. Theory"},{"key":"45_CR3","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.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-10428-7_8","volume-title":"Principles and Practice of Constraint Programming","author":"T-V-A Nguyen","year":"2014","unstructured":"Nguyen, T.-V.-A., Lallouet, A.: A complete solver for constraint games. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 58\u201374. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_8"},{"key":"45_CR5","doi-asserted-by":"crossref","unstructured":"Palmieri, A., Lallouet, A.: Constraint games revisited. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017), Melbourne, AU, pp. 729\u2013735 (2017)","DOI":"10.24963\/ijcai.2017\/101"},{"key":"45_CR6","volume-title":"Selfish Routing and the Price of Anarchy","author":"T Roughgarden","year":"2005","unstructured":"Roughgarden, T.: Selfish Routing and the Price of Anarchy. The MIT Press, Cambridge (2005)"},{"issue":"1","key":"45_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.artint.2008.10.005","volume":"173","author":"D Monderer","year":"2009","unstructured":"Monderer, D., Tennenholtz, M.: Strong mediated equilibrium. Artif. Intell. 173(1), 180\u2013195 (2009)","journal-title":"Artif. Intell."},{"key":"45_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/978-3-642-33558-7_66","volume-title":"Principles and Practice of Constraint Programming","author":"A Grubshtein","year":"2012","unstructured":"Grubshtein, A., Meisels, A.: Finding a nash equilibrium by asynchronous backtracking. In: Milano, M. (ed.) CP 2012. LNCS, pp. 925\u2013940. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_66"},{"key":"45_CR9","unstructured":"Litov, O., Meisels, A.: Distributed search for pure nash equilibria in graphical games. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems (AAMAS-2016), pp. 1279\u20131280 (2016)"},{"key":"45_CR10","unstructured":"Wahbi, M., Brown, K.N.: A distributed asynchronous solver for nash equilibria in hypergraphical games. In: ECAI, pp. 1291\u20131299 (2016)"},{"key":"45_CR11","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.: Asymmetric distributed constraint optimization problems. JAIR 47, 613\u2013647 (2013)","journal-title":"JAIR"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., Shapley, L.S.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"45_CR13","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.: Endogenous games and mechanisms: side payments among players. Rev. Econ. Stud. 72(2), 543\u2013566 (2005)","journal-title":"Rev. Econ. Stud."},{"key":"45_CR14","doi-asserted-by":"crossref","unstructured":"Kearns, M.J.: Graphical games. In: Vazirani, V.V., Nisan, N., Roughgarden, T., Tardos, \u00c9. (eds.) Algorithmic Game Theory, pp. 159\u2013178. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.009"},{"key":"45_CR15","doi-asserted-by":"crossref","DOI":"10.1515\/9781400833993","volume-title":"Social and Economic Networks","author":"MO Jackson","year":"2008","unstructured":"Jackson, M.O.: Social and Economic Networks, vol. 3. Princeton University Press, Princeton (2008)"},{"key":"45_CR16","first-page":"68","volume":"I","author":"V Levit","year":"2015","unstructured":"Levit, V., Komarovsky, Z., Grinshpoun, T., Meisels, A.: Tradeoffs between incentive mechanisms in Boolean games. IJCA I, 68\u201374 (2015)","journal-title":"IJCA"},{"key":"45_CR17","unstructured":"Jackson, M.O., Zenou, Y.: Games on networks. In: Young, P., Zamir, S. (eds.) Handbook of Game Theory , vol. 4, pp. 102\u2013191 (2014)"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Komarovsky, Z., Levit, V., Grinshpoun, T., Meisels, A.: Efficient equilibria in a public goods game. In: WI-IAT, pp. 214\u2013219 (2015)","DOI":"10.1109\/WI-IAT.2015.91"},{"key":"45_CR19","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-24013-3_6","volume-title":"IDC 2011","author":"A Grubshtein","year":"2012","unstructured":"Grubshtein, A., Meisels, A.: A distributed cooperative approach for optimizing a family of network games. In: Brazier, F.M.T., Nieuwenhuis, K., Pavlin, G., Warnier, M., Badica, C. (eds.) IDC 2011. Studies in Computational Intelligence, vol. 382, pp. 49\u201362. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-24013-3_6"},{"key":"45_CR20","unstructured":"Grubshtein, A., Zivan, R., Grinshpoun, T., Meisels, A.: Local search for distributed asymmetric optimization. In: AAMAS, pp. 1015\u20131022 (2010)"},{"key":"45_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.03.002","volume":"212","author":"R Zivan","year":"2014","unstructured":"Zivan, R., Okamoto, S., Peled, H.: Explorative anytime local search for distributed constraint optimization. Artif. Intell. 212, 1\u201326 (2014)","journal-title":"Artif. Intell."},{"key":"45_CR22","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1007\/s10458-017-9360-1","volume":"31","author":"R Zivan","year":"2017","unstructured":"Zivan, R., Parash, T., Cohen, L., Peled, H., Okamoto, S.: Balancing exploration and exploitation in incomplete min\/max-sum inference for distributed constraint optimization. Auton. Agents Multi Agent Syst. 31, 1165\u20131207 (2017)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"45_CR23","unstructured":"Shapley, L.: A value for n-person games. In: kunh, H.W., Tucker, A.W. (eds.) Contributions to the Theory of Games. Annals of Mathematical Studies, vol. 28, pp. 307\u2013317 (1953)"},{"issue":"3","key":"45_CR24","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/BF00141070","volume":"41","author":"J Hirshleifer","year":"1983","unstructured":"Hirshleifer, J.: From weakest-link to best-shot: the voluntary provision of public goods. Public Choice 41(3), 371\u2013386 (1983)","journal-title":"Public Choice"},{"key":"45_CR25","doi-asserted-by":"crossref","unstructured":"Nisan, N., Schapira, M., Valiant, G., Zohar, A.: Best-response mechanisms. In: Innovations in Computer Science - ICS, Beijing, China, pp. 155\u2013165 (2011)","DOI":"10.1145\/1993574.1993633"},{"key":"45_CR26","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1998549.1998552","volume":"10","author":"N Nisan","year":"2011","unstructured":"Nisan, N., Schapira, M., Valiant, G., Zohar, A.: When is it best to best-respond? SIGecom Exch. 10, 16\u201318 (2011)","journal-title":"SIGecom Exch."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T03:17:12Z","timestamp":1604805432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,85","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}