Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Approximation and Online Algorithms

WAOA 2017: Approximation and Online Algorithms pp 301–316Cite as

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10787))

Abstract

Additively separable hedonic games and fractional hedonic games have received considerable attention. These are coalition forming games of selfish agents based on their mutual preferences. Most of the work in the literature characterizes the existence and structure of stable outcomes (i.e., partitions in coalitions), assuming that preferences are given. However, there is little discussion on this assumption. In fact, agents receive different utilities if they belong to different partitions, and thus it is natural for them to declare their preferences strategically in order to maximize their benefit. In this paper we consider strategyproof mechanisms for additively separable hedonic games and fractional hedonic games, that is, partitioning methods without payments such that utility maximizing agents have no incentive to lie about their true preferences. We focus on social welfare maximization and provide several lower and upper bounds on the performance achievable by strategyproof mechanisms for general and specific additive functions. In most of the cases we provide tight or asymptotically tight results. All our mechanisms are simple and can be computed in polynomial time. Moreover, all the lower bounds are unconditional, that is, they do not rely on any computational or complexity assumptions.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Aziz, H., Brandt, F., Harrenstein, P.: Pareto optimality in coalition formation. Games Econ. Behav. 82, 562–581 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  2. Aziz, H., Brandt, F., Harrenstein, P.: Fractional hedonic games. In: Proceedings of the 13th International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 5–12 (2014)

    Google Scholar 

  3. Aziz, H., Brandt, F., Seedig, H.G.: Stable partitions in additively separable hedonic games. In: Proceedings of the Tenth International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 183–190 (2011)

    Google Scholar 

  4. Aziz, H., Gaspers, S., Gudmundsson, J., Mestre, J., Täubig, H.: Welfare maximization in fractional hedonic games. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI), pp. 461–467 (2015)

    Google Scholar 

  5. Aziz, H., Savani, R.: Hedonic games (Chap. 15). In: Computational Social Choice. Cambridge University Press, Cambridge (2016)

    Google Scholar 

  6. Bachrach, Y., Kohli, P., Kolmogorov, V., Zadimoghaddam, M.: Optimal coalition structure generation in cooperative graph games. In: Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI), pp. 81–87 (2013)

    Google Scholar 

  7. Banerjee, S., Konishi, H., Sönmez, T.: Core in a simple coalition formation game. Soc. Choice Welf. 18, 135–153 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1–3), 89–113 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Bilò, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: Nash stability in fractional hedonic games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 486–491. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-13129-0_44

    Google Scholar 

  10. Biló, V., Fanelli, A., Flammini, M., Monaco, G., Moscardelli, L.: On the price of stability of fractional hedonic games. In: Proceedings of the 14th International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 1239–1247 (2015)

    Google Scholar 

  11. Bloch, F., Diamantoudi, E.: Noncooperative formation of coalitions in hedonic games. Int. J. Game Theory 40, 262–280 (2010)

    MathSciNet  MATH  Google Scholar 

  12. Bogomolnaia, A., Jackson, M.O.: The stability of hedonic coalition structures. Games Econ. Behav. 38, 201–230 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Brandl, F., Brandt, F., Strobel, M.: Fractional hedonic games: individual and group stability. In: Proceedings of the 14th International Conference on Autonomous Agents and Multiagent Systems, (AAMAS), pp. 1219–1227 (2015)

    Google Scholar 

  14. Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71, 360–383 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. Demaine, E.D., Emanuel, D., Fiat, A., Immorlica, N.: Correlation clustering in general weighted graphs. Theoret. Comput. Sci. 361, 172–187 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  16. Deng, X., Papadimitriou, C.H.: On the complexity of cooperative solution concepts. Math. Oper. Res. 19(2), 257–266 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dréze, J.H., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48, 987–1003 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  18. Dughmi, S., Ghosh, A.: Truthful assignment without money. In: Proceedings of the 11th ACM Conference on Electronic Commerce (EC), pp. 325–334 (2010)

    Google Scholar 

  19. Elkind, E., Fanelli, A., Flammini, M.: Price of Pareto optimality in hedonic games. In: Proceedings of The Thirtieth AAAI Conference on Artificial Intelligence (AAAI), pp. 475–481 (2016)

    Google Scholar 

  20. Elkind, E., Wooldridge, M.: Hedonic coalition nets. In: Proceedings of the Eighth International Conference on Autonomous Agents and Multiagent Systems (AAMAS), pp. 417–424 (2009)

    Google Scholar 

  21. Feldman, M., Lewin-Eytan, L., Naor, J.S.: Hedonic clustering games. ACM Trans. Parallel Comput. 44, 1384–1402 (2015)

    Google Scholar 

  22. Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 174–185. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16170-4_16

    Chapter  Google Scholar 

  23. Kaklamanis, C., Kanellopoulos, P., Papaioannou, K.: The price of stability of simple symmetric fractional hedonic games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 220–232. Springer, Heidelberg (2016). https://doi.org/10.1007/978-3-662-53354-3_18

    Chapter  Google Scholar 

  24. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)

    Book  MATH  Google Scholar 

  25. Peters, D.: Graphical hedonic games of bounded treewidth. In: Proceedings of the Thirtieth Conference on Artificial Intelligence (AAAI), pp. 586–593 (2016)

    Google Scholar 

  26. Peters, D., Elkind, E.: Simple causes of complexity in hedonic games. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI), pp. 25–31 (2015)

    Google Scholar 

  27. Procaccia, A.D., Tennenholtz, M.: Approximate mechanism design without money. In: Proceedings of the 10th ACM Conference on Electronic Commerce (EC), pp. 177–186 (2009)

    Google Scholar 

  28. Rodríguez-Álvarez, C.: Strategy-proof coalition formation. Int. J. Game Theory 38(3), 431–452 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  29. Vallée, T., Bonnet, G., Zanuttini, B., Bourdon, F.: A study of sybil manipulations in hedonic games. In: Proceedings of the Thirteenth International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 21–28 (2014)

    Google Scholar 

  30. Woeginger, G.J.: Core stability in hedonic coalition formation. In: van Emde Boas, P., Groen, F.C.A., Italiano, G.F., Nawrocki, J., Sack, H. (eds.) SOFSEM 2013. LNCS, vol. 7741, pp. 33–50. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35843-2_4

    Chapter  Google Scholar 

  31. Wright, M., Vorobeychik, Y.: Mechanism design for team formation. In: Proceedings of the Twenty-Ninth Conference on Artificial Intelligence (AAAI), pp. 1050–1056 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. GSSI Institute, University of L’Aquila, L’Aquila, Italy

    Michele Flammini

  2. University of L’Aquila, L’Aquila, Italy

    Gianpiero Monaco

  3. Sapienza University of Rome, Rome, Italy

    Qiang Zhang

Authors
  1. Michele Flammini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gianpiero Monaco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Qiang Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gianpiero Monaco .

Editor information

Editors and Affiliations

  1. The University of Western Ontario, London, Ontario, Canada

    Roberto Solis-Oba

  2. German University of Technology in Oman, Muscat, Oman

    Rudolf Fleischer

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Flammini, M., Monaco, G., Zhang, Q. (2018). Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games. In: Solis-Oba, R., Fleischer, R. (eds) Approximation and Online Algorithms. WAOA 2017. Lecture Notes in Computer Science(), vol 10787. Springer, Cham. https://doi.org/10.1007/978-3-319-89441-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-89441-6_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-89440-9

  • Online ISBN: 978-3-319-89441-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation