Computing desirable partitions in additively separable hedonic games
From MaRDI portal
Recommendations
Cited in
(37)- On Pareto optimality in social distance games
- Coordination games on graphs
- Finding and Recognizing Popular Coalition Structures
- Efficient equilibria in polymatrix coordination games
- Hedonic games and treewidth revisited
- On the price of stability of some simple graph-based hedonic games
- Two hardness results for core stability in hedonic coalition formation games
- Price of Pareto optimality in hedonic games
- Stability in online coalition formation
- Stable and Pareto optimal group activity selection from ordinal preferences
- Stability based on single-agent deviations in additively separable hedonic games
- A social choice approach to ordinal group activity selection
- Strategyproof mechanisms for additively separable hedonic games and fractional hedonic games
- Maximizing utilitarian and egalitarian welfare of fractional hedonic games on tree-like graphs
- Toward the complexity of the existence of wonderfully stable partitions and strictly core stable coalition structures in enemy-oriented hedonic games
- Forming \(k\) coalitions and facilitating relationships in social networks
- Local fairness in hedonic games via individual threshold coalitions
- On non-trivial Nash stable partitions in additive hedonic games with symmetric 0/1-utilities
- The price of stability of simple symmetric fractional hedonic games
- Borda-induced hedonic games with friends, enemies, and neutral players
- Computational complexity in additive hedonic games
- Core stability in additively separable hedonic games of low treewidth
- Additively separable hedonic games with social context
- The three-dimensional stable roommates problem with additively separable preferences
- Strategyproof mechanisms for additively separable and fractional hedonic games
- Answers set programs for non-transferable utility games: expressiveness, complexity and applications
- Solving Woeginger's hiking problem: wonderful partitions in anonymous hedonic games
- Core stability in additively separable hedonic games of low treewidth
- Coalitional games induced by matching problems: complexity and islands of tractability for the Shapley value
- Optimal seat arrangement: what are the hard and easy cases?
- Learning convex partitions and computing game-theoretic equilibria from best response queries
- Relaxed core stability in hedonic games
- Dynamics in matching and coalition formation games with structural constraints
- Altruistic Hedonic Games
- Computing Stable Outcomes in Symmetric Additively Separable Hedonic Games
- Topological distance games
- Duplication monotonicity in the allocation of indivisible goods
This page was built for publication: Computing desirable partitions in additively separable hedonic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360127)
