{"type":"ScholarlyArticle","title":"Altruism in Coalition Formation Games","authors":[{"name":"Anna Maria Kerkmann","slug":"anna-maria-kerkmann","given":"Anna Maria","family":"Kerkmann","affiliation":"Institut für Informatik , Heinrich-Heine-Universität Düsseldorf , Germany"},{"name":"Jörg Rothe","slug":"jorg-rothe","given":"Jörg","family":"Rothe","affiliation":"Institut für Informatik , Heinrich-Heine-Universität Düsseldorf , Germany"}],"abstract":"Nguyen et al. [2016] introduced altruistic hedonic games in which agents’ utilities depend not only on their own preferences but also on those of their friends in the same coalition. We propose to extend their model to coalition formation games in general, considering also the friends in other coalitions. Comparing the two models, we argue that excluding some friends from the altruistic behavior of an agent is a major disadvantage that comes with the restriction to hedonic games. After introducing our model, we additionally study some common stability notions and provide a computational analysis of the associated verification and existence problems.","doi":"10.24963/ijcai.2020/49","url":"https://ijcai.org/proceedings/2020/49","pdf":"https://ijcai.org/proceedings/2020/0049.pdf","markdown":"https://ijcai.org/proceedings/2020/49.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/49","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Agent-based and Multi-agent Systems","track":"Main track","number":49,"pages":{"first":347,"last":353},"keywords":["Agent-based and Multi-agent Systems: Cooperative Games","Agent-based and Multi-agent Systems: Algorithmic Game Theory","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24303/file_24303.m3u8","length_sec":300,"provider":"hls"}],"references":[{"position":1,"raw":"[Apt and Schäfer, 2014] Krzysztof Apt and Guido Schäfer. Selfishness level of strategic games. Journal of Artificial Intelligence Research, 49:207-240, February 2014.","title":"Selfishness level of strategic games","authors":"Krzysztof Apt, Guido Schäfer","year":"2014","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ashlagi et al., 2008] Itai Ashlagi, Piotr Krysta, and Moshe Tennenholtz. Social context games. In Proc. WINE'08, pages 675-683. Springer-Verlag LNCS #5385, December 2008.","title":"Social context games","authors":"Itai Ashlagi, Piotr Krysta, Moshe Tennenholtz","year":"2008","venue":"Proc. WINE'08","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Aziz and Savani, 2016] Haris Aziz and Rahul Savani. He- donic games. In Felix Brandt, Vincent Conitzer, Ulle En- driss, Jérôme Lang, and Ariel Procaccia, editors, Hand- book of Computational Social Choice, chapter 15, pages 356-376. Cambridge University Press, 2016.","title":"Hedonic games","authors":"Haris Aziz, Rahul Savani","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Aziz et al., 2013] Haris Aziz, Felix Brandt, and Hans Georg Seedig. Computing desirable partitions in additively sepa- rable hedonic games. Artificial Intelligence, 195:316-334, February 2013.","title":"Computing desirable partitions in additively separable hedonic games","authors":"Haris Aziz, Felix Brandt, Hans Georg, Seedig","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Aziz et al., 2019] Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, and Dominik Peters. Frac- tional hedonic games. ACM Transactions on Economics and Computation, 7(2):Article 6, June 2019.","title":"Fractional hedonic games","authors":"Haris Aziz, Florian Brandl, Felix Brandt, Paul Harrenstein, Martin Olsen, Dominik Peters","year":"2019","venue":"ACM Transactions on Economics and Computation","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bell, 1938] Eric Temple Bell. The iterated exponential inte- gers. Annals of Mathematics, pages 539-557, July 1938.","title":"The iterated exponential integers","authors":"Eric Temple, Bell","year":"1938","venue":"Annals of Mathematics","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brandt et al., 2009] Felix Brandt, Felix Fischer, Paul Har- renstein, and Yoav Shoham. Ranking games. Artificial Intelligence, 173(2):221-239, February 2009.","title":"Ranking games","authors":"Felix Brandt, Felix Fischer, Paul Harrenstein, Yoav Shoham","year":"2009","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Brânzei and Larson, 2011] Simina Brânzei and Kate Lar- son. Social distance games. In Proc. IJCAI'11, pages 91-96. AAAI Press/IJCAI, July 2011.","title":"Simina Brânzei and Kate Larson. Social distance games","authors":"Larson Brânzei","year":"2011","venue":"Proc. IJCAI'11","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Cechlárová and Romero-Medina, 2001] Katarína Cechláro- vá and Antonio Romero-Medina. Stability in coalition formation games. International Journal of Game Theory, 29(4):487-494, 2001.","title":"Katarína Cechlárová and Antonio Romero-Medina. Stability in coalition formation games","authors":"Romero-Medina Cechlárová","year":"2001","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cechlárová and Hajduková, 2003] Katarína Cechlárová and Jana Hajduková. Computational complexity of stable par- titions with B-preferences. International Journal of Game Theory, 31(3):353-364, June 2003.","title":"Katarína Cechlárová and Jana Hajduková. Computational complexity of stable partitions with B-preferences","authors":"Hajduková Cechlárová","year":"2003","venue":"International Journal of Game Theory","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Chen et al., 2011] Po-An Chen, Bart de Keijzer, David Kempe, and Guido Schäfer. The robust price of anarchy of altruistic games. In Proc. WINE'11, pages 383-390. Springer-Verlag LNCS #7090, December 2011.","title":"The robust price of anarchy of altruistic games","authors":"Chen","year":"2011","venue":"Proc. WINE'11","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dimitrov et al., 2006] Dinko Dimitrov, Peter Borm, Ruud Hendrickx, and Shao-Chin Sung. Simple priorities and core stability in hedonic games. Social Choice and Wel- fare, 26(2):421-433, April 2006.","title":"Simple priorities and core stability in hedonic games","authors":"Dinko Dimitrov, Peter Borm, Ruud Hendrickx, Shao-Chin Sung","year":"2006","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gonzalez, 1985] Teofilo Gonzalez. Clustering to minimize the maximum intercluster distance. Theoretical Computer Science, 38:293-306, 1985.","title":"Clustering to minimize the maximum intercluster distance","authors":"Teofilo Gonzalez","year":"1985","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hayrapetyan et al., 2006] Ara Hayrapetyan, Éva Tardos, and Tom Wexler. The effect of collusion in congestion games. In Proc. STOC'06, pages 89-98. ACM Press, May 2006.","title":"The effect of collusion in congestion games","authors":"Ara Hayrapetyan, Éva Tardos, Tom Wexler","year":"2006","venue":"Proc. STOC'06","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Hoefer and Skopalik, 2009] Martin Hoefer and Alexander Skopalik. Altruism in atomic congestion games. In Proc. ESA'09, pages 179-189. Springer-Verlag LNCS #5757, September 2009.","title":"Altruism in atomic congestion games","authors":"Skopalik Hoefer, Martin Hoefer, Alexander Skopalik","year":"2009","venue":"Proc. ESA'09","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kerkmann and Rothe, 2019] Anna Maria Kerkmann and Jörg Rothe. Stability in FEN-hedonic games for single- player deviations. In Proc. AAMAS'19, pages 891-899.","title":"Stability in FEN-hedonic games for singleplayer deviations","authors":"Anna Maria, Kerkmann, Jörg Rothe","year":null,"venue":"Proc. AAMAS'19","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"IFAAMAS, May 2019.","title":null,"authors":"Ifaamas","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Kerkmann et al., 2020] Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, and Lena Schend. Hedonic games with ordinal preferences and thresholds. Journal of Artificial Intelligence Research, 67:705-756, April 2020.","title":"Hedonic games with ordinal preferences and thresholds","authors":"Anna Maria Kerkmann, Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend","year":"2020","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kuniavsky and Smorodinsky, 2014] Sergey Kuniavsky and Rann Smorodinsky. Equilibrium and potential in coali- tional congestion games. Theory and Decision, 76:69-79, January 2014.","title":"Sergey Kuniavsky and Rann Smorodinsky. Equilibrium and potential in coalitional congestion games","authors":"Smorodinsky Kuniavsky","year":"2014","venue":"Theory and Decision","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lang et al., 2015] Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, and Lena Schend. Representing and solving hedonic games with ordinal preferences and thresholds. In Proc. AAMAS'15, pages 1229-1237, May 2015.","title":"Representing and solving hedonic games with ordinal preferences and thresholds","authors":"Jérôme Lang, Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend","year":"2015","venue":"Proc. AAMAS'15","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Monaco et al., 2018] Gianpiero Monaco, Luca Moscardelli, and Yllka Velaj. Hedonic games with social context. In Proc. ICTCS'18, volume 2234, pages 24-35. CEUR- WS.org, September 2018.","title":"Hedonic games with social context","authors":"Gianpiero Monaco, Luca Moscardelli, Yllka Velaj","year":"2018","venue":"Proc. ICTCS'18","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Monaco et al., 2019] Gianpiero Monaco, Luca Moscardelli, and Yllka Velaj. On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare. In Proc. AAMAS'19, pages 873-881. IFAAMAS, May 2019.","title":"On the performance of stable outcomes in modified fractional hedonic games with egalitarian social welfare","authors":"Gianpiero Monaco, Luca Moscardelli, Yllka Velaj","year":"2019","venue":"Proc. AAMAS'19","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Nguyen et al., 2016] Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, and Lena Schend. Altruistic hedonic games. In Proc. AAMAS'16, pages 251-259. IFAAMAS, May 2016.","title":"Altruistic hedonic games","authors":"Nhan-Tam Nguyen, Anja Rey, Lisa Rey, Jörg Rothe, Lena Schend","year":"2016","venue":"Proc. AAMAS'16","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Rahn and Schäfer, 2013] Mona Rahn and Guido Schäfer. Bounding the inefficiency of altruism through social con- tribution games. In Proc. WINE'13, pages 391-404. Springer-Verlag LNCS #8289, December 2013.","title":"Bounding the inefficiency of altruism through social contribution games","authors":"Schäfer Rahn, Mona Rahn, Guido Schäfer","year":"2013","venue":"Proc. WINE'13","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rota, 1964] Gian-Carlo Rota. The number of partitions of a set. The American Mathematical Monthly, 71(5):498-504, 1964.","title":"The number of partitions of a set","authors":"Gian-Carlo Rota","year":"1964","venue":"The American Mathematical Monthly","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rothe et al., 2018] Jörg Rothe, Hilmar Schadrack, and Lena Schend. Borda-induced hedonic games with friends, ene- mies, and neutral players. Mathematical Social Sciences, 96:21-36, November 2018.","title":"Borda-induced hedonic games with friends, enemies, and neutral players","authors":"Rothe","year":"2018","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Schlueter and Goldsmith, 2018] Jacob Schlueter and Judy Goldsmith. Super altruistic hedonic games. In Proc. MPREF'18, January 2018.","title":"Super altruistic hedonic games","authors":"Goldsmith Schlueter, Jacob Schlueter, Judy Goldsmith","year":"2018","venue":"Proc. MPREF'18","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Sung and Dimitrov, 2010] Shao-Chin Sung and Dinko Dimitrov. Computational complexity in additive hedonic games. European Journal of Operational Research, 203(3):635-639, June 2010.","title":"Computational complexity in additive hedonic games","authors":"Chin Shao, Dinko Sung, Dimitrov","year":"2010","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Woeginger, 2013] Gerhard Woeginger. A hardness result for core stability in additive hedonic games. Mathemat- ical Social Sciences, 65(2):101-104, March 2013.","title":"A hardness result for core stability in additive hedonic games","authors":"Gerhard Woeginger","year":"2013","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}