Pages that link to "Item:Q1414457"
From MaRDI portal
The following pages link to Computational complexity of stable partitions with b-preferences (Q1414457):
Displaying 14 items.
- Nash stability in additively separable hedonic games and community structures (Q733746) (← links)
- Computational complexity in additive hedonic games (Q1046065) (← links)
- Stable partitions with \(\mathcal W\)-preferences (Q1827807) (← links)
- The kidney exchange problem: how hard is it to find a donor? (Q1931639) (← links)
- Housing markets through graphs (Q1959727) (← links)
- The core of housing markets from an agent's perspective: Is it worth sprucing up your home? (Q2152118) (← links)
- Borda-induced hedonic games with friends, enemies, and neutral players (Q2317997) (← links)
- The computational complexity of rationalizing boundedly rational choice behavior (Q2427841) (← links)
- Simple priorities and core stability in hedonic games (Q2432488) (← links)
- Two hardness results for core stability in hedonic coalition formation games (Q2446827) (← links)
- On core membership testing for hedonic coalition formation games (Q2643787) (← links)
- (Q3002403) (← links)
- (Q3604325) (← links)
- Altruistic Hedonic Games (Q5043571) (← links)