Pages that link to "Item:Q1046065"
From MaRDI portal
The following pages link to Computational complexity in additive hedonic games (Q1046065):
Displaying 21 items.
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games (Q314437) (← links)
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities (Q456174) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- Nash stability in additively separable hedonic games and community structures (Q733746) (← links)
- Dynamics in matching and coalition formation games with structural constraints (Q1711887) (← links)
- NP-completeness in hedonic games (Q1886742) (← links)
- A hardness result for core stability in additive hedonic games (Q1940711) (← links)
- Precise complexity of the core in dichotomous and additive hedonic games (Q1990301) (← links)
- On Pareto optimality in social distance games (Q2093365) (← links)
- Non-existence of stable social groups in information-driven networks (Q2158297) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- Additively separable hedonic games with social context (Q2669108) (← links)
- The three-dimensional stable roommates problem with additively separable preferences (Q2670931) (← links)
- Computing Stable Outcomes in Hedonic Games (Q3162517) (← links)
- Altruistic Hedonic Games (Q5043571) (← links)
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games (Q5108232) (← links)
- Balancing stability and efficiency in team formation as a generalized roommate problem (Q6078610) (← links)
- Topological distance games (Q6118301) (← links)
- Solidarity to achieve stability (Q6554632) (← links)
- Stability based on single-agent deviations in additively separable hedonic games (Q6592981) (← links)
