The following pages link to NP-completeness in hedonic games (Q1886742):
Displaying 10 items.
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- Hedonic coalition formation games: a new stability notion (Q545162) (← links)
- Nash stability in additively separable hedonic games and community structures (Q733746) (← links)
- Formation of segregated and integrated groups (Q878165) (← links)
- Individual and group stability in neutral restrictions of hedonic games (Q899374) (← links)
- The computational complexity of rationalizing behavior (Q972378) (← links)
- Computational complexity in additive hedonic games (Q1046065) (← links)
- Group activity selection problem with approval preferences (Q1621725) (← links)
- A social choice approach to ordinal group activity selection (Q1642162) (← links)
- Stable and Pareto optimal group activity selection from ordinal preferences (Q1757088) (← links)
