For friends-appreciation hedonic games, there exists a non-obviously manipulable mechanism that computes an optimal partition, and a polynomial-time one achieving a (4+o(1))-approximation.
Core in a simple coalition forma- tion game
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Non-obvious Manipulability in Hedonic Games with Friends Appreciation Preferences
For friends-appreciation hedonic games, there exists a non-obviously manipulable mechanism that computes an optimal partition, and a polynomial-time one achieving a (4+o(1))-approximation.