Group activity selection on graphs: parameterized analysis

DOI10.1007/978-3-319-66700-3_9MaRDI QIDQ681851zbMATH OpenOpenAlexFDO

Authors Sushmita Gupta, Sanjukta Roy, Saket Saurabh, Meirav Zehavi

Publication date 13 February 2018

Full work available at URL https://doi.org/10.1007/978-3-319-66700-3_9

zbMATH Keywords

NP-hardNash stabilitygroup activity selection problem

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Games involving graphs (91A43)

Recommendations

• scientific article; zbMATH DE number 1004934
• Group activity selection with few agent types
• Group activity selection with few agent types
• On groupies in graphs
• On group choosability of total graphs
• Simplified group activity selection with group size constraints
• Group activity selection from ordinal preferences
• Stable and Pareto optimal group activity selection from ordinal preferences
• On group choosability of graphs. II
• On the activities and partitions of the vertex subsets of graphs

Cited in

(8)

• On treewidth and stable marriage: parameterized algorithms and hardness results (complete characterization)
• On simplified group activity selection
• Group activity selection problem with approval preferences
• Simplified group activity selection with group size constraints
• Group activity selection with few agent types
• Cooperative games with overlapping coalitions: charting the tractability frontier
• Balanced stable marriage: how close is close enough?
• scientific article; zbMATH DE number 7525485 (Why is no real title available?)

This page was built for publication: Group activity selection on graphs: parameterized analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q681851)