{"type":"ScholarlyArticle","title":"Socially Motivated Partial Cooperation in Multi-agent Local Search","authors":[{"name":"Tal Ze'evi","slug":"tal-ze-evi","given":"Tal","family":"Ze'evi","affiliation":"University of the Negev Beer-Sheva , Israel"},{"name":"Roie Zivan","slug":"roie-zivan","given":"Roie","family":"Zivan","affiliation":"University of the Negev Beer-Sheva , Israel"},{"name":"Omer Lev","slug":"omer-lev","given":"Omer","family":"Lev","affiliation":"University of the Negev Beer-Sheva , Israel"}],"abstract":"Partial Cooperation is a paradigm and a corresponding\r\nmodel, proposed to represent multi-agent\r\nsystems in which agents are willing to cooperate\r\nto achieve a global goal, as long as some minimal\r\nthreshold on their personal utility is satisfied. Distributed\r\nlocal search algorithms were proposed in\r\norder to solve asymmetric distributed constraint optimization\r\nproblems (ADCOPs) in which agents are\r\npartially cooperative.\r\n\r\nWe contribute by: 1) extending the partial cooperative\r\nmodel to allow it to represent dynamic cooperation\r\nintentions, affected by changes in agents’\r\nwealth, in accordance with social studies literature.\r\n2) proposing a novel local search algorithm\r\nin which agents receive indications of others’ preferences\r\non their actions and thus, can perform actions\r\nthat are socially beneficial. Our empirical\r\nstudy reveals the advantage of the proposed algorithm\r\nin multiple benchmarks. Specifically, on realistic\r\nmeeting scheduling problems it overcomes\r\nlimitations of standard local search algorithms.","doi":"10.24963/ijcai.2018/81","url":"https://ijcai.org/proceedings/2018/81","pdf":"https://ijcai.org/proceedings/2018/0081.pdf","markdown":"https://ijcai.org/proceedings/2018/81.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/81","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":81,"pages":{"first":583,"last":589},"keywords":["Constraints and SAT: Distributed Constraints","Agent-based and Multi-agent Systems: Coordination and Cooperation"],"videos":[],"references":[{"position":1,"raw":"[Albert and Barabási, 2002] Réka Albert and Albert-László Barabási. Statistical mechanics of complex networks. Re- views of modern physics, 74(1):47, 2002.","title":"Statistical mechanics of complex networks","authors":"Albert, Barabási ;, Réka Albert, Albert-László Barabási","year":"2002","venue":"Reviews of modern physics","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Brito et al., 2009] Ismel Brito, Amnon Meisels, Pedro Meseguer, and Roie Zivan. Distributed constraint sat- isfaction with partially known constraints. Constraints, 14(2):199-234, 2009.","title":"Distributed constraint satisfaction with partially known constraints","authors":"Brito","year":"2009","venue":"Constraints","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Gershman et al., 2009] A. Gershman, A. Meisels, and R. Zivan. Asynchronous forward bounding. J. of Artifi- cial Intelligence Research, 34:25-46, 2009.","title":"Asynchronous forward bounding","authors":"A Gershman, A Meisels, R Zivan","year":"2009","venue":"J. of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Grant et al., 2011] J. Grant, S. Kraus, M. Wooldridge, and I. Zuckerman. Manipulating boolean games through com- munication. In IJCAI, pages 210-215, 2011.","title":"Manipulating boolean games through communication","authors":"J Grant, S Kraus, M Wooldridge, I Zuckerman","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2011/46"},{"position":5,"raw":"[Greenstadt et al., 2006] R. Greenstadt, J. Pearce, and M. Tambe. Analysis of privacy loss in distributed con- straint optimization. In AAAI-06, pages 647-653, Boston, MA, USA, July 2006.","title":"Analysis of privacy loss in distributed constraint optimization","authors":"R Greenstadt, J Pearce, M Tambe","year":"2006","venue":"AAAI-06","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Grinshpoun et al., 2013] Tal Grinshpoun, Alon Grubshtein, Roie Zivan, Arnon Netzer, and Amnon Meisels. Asym- metric distributed constraint optimization problems. J. Ar- tif. Intell. Res. (JAIR), 47:613-647, 2013.","title":"Asymmetric distributed constraint optimization problems","authors":"Alon Tal Grinshpoun, Roie Grubshtein, Arnon Zivan, Amnon Netzer, Meisels","year":"2013","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Grubshtein et al., 2010] A. Grubshtein, R. Zivan, T. Grin- shpon, and A. Meisels. Local search for distributed asym- metric optimization. In AAMAS 2010, pages 1015-1022, May 2010.","title":"Local search for distributed asymmetric optimization","authors":"A Grubshtein, R Zivan, T Grinshpon, A Meisels","year":"2010","venue":"AAMAS 2010","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Grubshtein et al., 2012] Alon Grubshtein, Roie Zivan, and Amnon Meisels. Partial cooperation in multi-agent local search. In ECAI 2012 -20th European Conference on Ar- tificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track, Montpellier, France, August 27-31 , 2012, pages 378-383, 2012.","title":"Partial cooperation in multi-agent local search","authors":"Alon Grubshtein, Roie Zivan, Amnon Meisels","year":"2012","venue":"ECAI 2012 -20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kahneman and Tversky, 1979] Daniel Kahneman and Amos Tversky. Prospect theory: An analysis of decision under risk. Econometrica: Journal of the econometric society, pages 263-291, 1979.","title":"Prospect theory: An analysis of decision under risk","authors":"Tversky Kahneman, Daniel Kahneman, Amos Tversky","year":"1979","venue":"Econometrica: Journal of the econometric society","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[LaBarge and Stinson, 2014] Monica C LaBarge and Jef- frey L Stinson. The role of mental budgeting in philan- thropic decision-making. Nonprofit and Voluntary Sector Quarterly, 43(6):993-1013, 2014.","title":"The role of mental budgeting in philanthropic decision-making","authors":"C Monica, Jeffrey L Labarge, Stinson","year":"2014","venue":"Nonprofit and Voluntary Sector Quarterly","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lutati et al., 2014] Benny Lutati, Inna Gontmakher, Michael Lando, Arnon Netzer, Amnon Meisels, and Alon Grubshtein. Agentzero: A framework for simulating and evaluating multi-agent algorithms. In Agent-Oriented Software Engineering -Reflections on Architectures, Methodologies, Languages, and Frameworks, pages 309-327. 2014.","title":"Agentzero: A framework for simulating and evaluating multi-agent algorithms","authors":"Lutati","year":"2014","venue":"Agent-Oriented Software Engineering -Reflections on Architectures, Methodologies, Languages, and Frameworks","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Maheswaran et al., 2004] R. T. Maheswaran, J. P. Pearce, and M. Tambe. Distributed algorithms for dcop: A graphical-game-based approach. In PDCS), pages 432- 439, September 2004.","title":"Distributed algorithms for dcop: A graphical-game-based approach","authors":"R T Maheswaran, J P Pearce, M Tambe","year":"2004","venue":"PDCS)","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Meir et al., 2014] Reshef Meir, Omer Lev, and Jeffrey S. Rosenschein. A local-dominance theory of voting equilib- ria. In Proceedings of the 15th ACM conference on Eco- nomics and Computation (EC), pages 313-330, Palo Alto, Califronia, June 2014.","title":"A local-dominance theory of voting equilibria","authors":"Reshef Meir, Omer Lev, Jeffrey S Rosenschein","year":"2014","venue":"Proceedings of the 15th ACM conference on Economics and Computation (EC)","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Modi et al., 2005] P. J. Modi, W. Shen, M. Tambe, and M. Yokoo. Adopt: asynchronous distributed constraints optimizationwith quality guarantees. Artificial Intelli- gence, 161:1-2:149-180, January 2005.","title":"Adopt: asynchronous distributed constraints optimizationwith quality guarantees","authors":"P J Modi, W Shen, M Tambe, M Yokoo","year":"2005","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Staples, 2004] Chris Staples. What does corporate social responsibility mean for charitable fundraising in the uk? International Journal of Nonprofit and Voluntary Sector Marketing, 9(2):154-158, 2004.","title":"What does corporate social responsibility mean for charitable fundraising in the uk?","authors":"Chris Staples","year":"2004","venue":"International Journal of Nonprofit and Voluntary Sector Marketing","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Stranders et al., 2009] Ruben Stranders, Alessandro Farinelli, Alex Rogers, and Nicholas R. Jennings. Decen- tralised coordination of mobile sensors using the max-sum algorithm. In IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009, pages 299-304, 2009.","title":"Decentralised coordination of mobile sensors using the max-sum algorithm","authors":"Ruben Stranders, Alessandro Farinelli, Alex Rogers, Nicholas R Jennings","year":"2009","venue":"Proceedings of the 21st International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2009/58"},{"position":17,"raw":"[Trivers, 1971] Robert L Trivers. The evolution of reciprocal altruism. The Quarterly review of biology, 46(1):35-57, 1971.","title":"The evolution of reciprocal altruism","authors":"Robert L Trivers","year":"1971","venue":"The Quarterly review of biology","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Wiepking and Breeze, 2012] Pamala Wiepking and Beth Breeze. Feeling poor, acting stingy: The effect of money perceptions on charitable giving. International Journal of Nonprofit and Voluntary Sector Marketing, 17(1):13-24, 2012.","title":"Pamala Wiepking and Beth Breeze. Feeling poor, acting stingy: The effect of money perceptions on charitable giving","authors":"Breeze Wiepking","year":"2012","venue":"International Journal of Nonprofit and Voluntary Sector Marketing","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Zivan et al., 2012] Roie Zivan, Alon Grubshtein, Michal Friedman, and Amnon Meisels. Partial cooperation in multi-agent search. In International Conference on Au- tonomous Agents and Multiagent Systems, AAMAS 2012, Valencia, Spain, June 4-8, 2012 (3 Volumes), pages 1267- 1268, 2012.","title":"Partial cooperation in multi-agent search","authors":"Roie Zivan, Alon Grubshtein, Michal Friedman, Amnon Meisels","year":"2012","venue":"International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2012","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Zivan et al., 2014] R. Zivan, S. Okamoto, and H. Peled. Ex- plorative anytime local search for distributed constraint optimization. Artificial Intelligence, 211, 2014.","title":"Explorative anytime local search for distributed constraint optimization","authors":"R Zivan, S Okamoto, H Peled","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}