Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithmic Decision Theory

ADT 2017: Algorithmic Decision Theory pp 255–269Cite as

On Simplified Group Activity Selection

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10576))

Abstract

Several real-world situations can be represented in terms of agents that have preferences over activities in which they may participate. Often, the agents can take part in at most one activity (for instance, since these take place simultaneously), and there are additional constraints on the number of agents that can participate in an activity. In such a setting we consider the task of assigning agents to activities in a reasonable way. We introduce the simplified group activity selection problem providing a general yet simple model for a broad variety of settings, and start investigating the case where upper and lower bounds of the groups have to be taken into account. We apply different solution concepts such as envy-freeness and core stability to our setting and provide a computational complexity study for the problem of finding such solutions.

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

Notes

  1. 1.

    Still, it is possible to express simplified group activity selection within the setting of hedonic games, by adding special agents corresponding to activities, who are indifferent between all locally feasible coalitions. See the work by Darmann et al. [5] for such a translation for the more general group activity selection problem. But it is a rather artificial, and overly complex, representation of our model, which moreover does not help characterizing and computing solution concepts.

References

  1. Aziz, H., Savani, R.: Hedonic games. In: Brandt, F., Conitzer, V., Endriss, U., Lang, J., Procaccia, A.D. (eds.) Handbook of Computational Social Choice. Cambridge University Press (2015). Chap. 15

    Google Scholar 

  2. Cechlárová, K., Fleiner, T.: Pareto optimal matchings with lower quotas. Math. Soc. Sci. 88, 3–10 (2017)

    Article  MathSciNet  Google Scholar 

  3. Chamberlin, J.R., Courant, P.N.: Representative deliberations and representative decisions: proportional representation and the Borda rule. Am. Polit. Sci. Rev. 77(3), 718–733 (1983)

    Article  Google Scholar 

  4. Darmann, A.: Group activity selection from ordinal preferences. In: Walsh, T. (ed.) ADT 2015. LNCS (LNAI), vol. 9346, pp. 35–51. Springer, Cham (2015). doi:10.1007/978-3-319-23114-3_3

    Chapter  Google Scholar 

  5. Darmann, A., Elkind, E., Kurz, S., Lang, J., Schauer, J., Woeginger, G.: Group activity selection problem. In: Goldberg, P.W. (ed.) WINE 2012. LNCS, vol. 7695, pp. 156–169. Springer, Heidelberg (2012). doi:10.1007/978-3-642-35311-6_12

    Chapter  Google Scholar 

  6. Goto, M., Hashimoto, N., Iwasaki, A., Kawasaki, Y., Ueda, S., Yasuda, Y., Yokoo, M.: Strategy-proof matching with regional minimum quotas. In: Proceedings of the 2014 International Conference on Autonomous Agents and Multi-agent Systems, pp. 1225–1232. International Foundation for Autonomous Agents and Multiagent Systems (2014)

    Google Scholar 

  7. Hein, J., Jiang, T., Wang, L., Zhang, K.: On the complexity of comparing evolutionary trees. Discrete Appl. Math. 71, 153–169 (1996)

    Article  MathSciNet  Google Scholar 

  8. Hickey, G., Dehne, F., Rau-Chaplin, A., Blouin, C.: SPR distance computation for unrooted trees. Evol. Bioinform. 4, 17–27 (2008)

    Article  Google Scholar 

  9. Igarashi, A., Bredereck, R., Elkind, E.: On parameterized complexity of group activity selection problems on social networks (2017). CoRR abs/1703.01121

    Google Scholar 

  10. Kamiyama, N.: A note on the serial dictatorship with project closures. Oper. Res. Lett. 41(5), 559–561 (2013)

    Article  MathSciNet  Google Scholar 

  11. Lee, H., Williams, V.V.: Parameterized complexity of group activity selection. In: Proceedings of the 16th International Conference on Autonomous Agents and Multiagent Systems (AAMAS-2017), IFAAMAS, May 2017

    Google Scholar 

  12. Lu, T., Boutilier, C.: Budgeted social choice: From consensus to personalized decision making. In: IJCAI (2011)

    Google Scholar 

  13. Monroe, B.L.: Fully proportional representation. Am. Polit. Sci. Rev. 89, 925–940 (1995)

    Article  Google Scholar 

  14. Monte, D., Tumennasan, N.: Matching with quorums. Econ. Lett. 120(1), 14–17 (2013)

    Article  MathSciNet  Google Scholar 

  15. Pisinger, D.: An O(nr) Algorithm for the Subset Sum Problem. DIKU-Rapport, Datalogisk Institut, Københavns Universitet, Datalogisk Institut København (1995)

    Google Scholar 

  16. Skowron, P., Faliszewski, P., Slinko, A.M.: Achieving fully proportional representation: Approximability results. Artif. Intell. 222, 67–103 (2015)

    Article  MathSciNet  Google Scholar 

  17. Spradling, M., Goldsmith, J.: Stability in role based hedonic games. In: Proceedings of the Twenty-Eighth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2015, Hollywood, Florida, 18–20 May 2015, pp. 85–90 (2015)

    Google Scholar 

Download references

Acknowledgement

This work was partly supported by COST Action IC1205 on Computational Social Choice.

Author information

Authors and Affiliations

  1. University of Graz, Graz, Austria

    Andreas Darmann

  2. University of Tübingen, Tübingen, Germany

    Janosch Döcker, Britta Dorn & Sebastian Schneckenburger

  3. Université Paris-Dauphine, Paris, France

    Jérôme Lang

Authors
  1. Andreas Darmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Janosch Döcker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Britta Dorn
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jérôme Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sebastian Schneckenburger
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Darmann .

Editor information

Editors and Affiliations

  1. Heinrich Heine University, Düsseldorf, Germany

    Jörg Rothe

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Darmann, A., Döcker, J., Dorn, B., Lang, J., Schneckenburger, S. (2017). On Simplified Group Activity Selection. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-67504-6_18

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation