Defines multi-winner voting games in TU and NTU, then analyzes core non-emptiness and computation for AV, SAV, CC, and PAV under approval utilities.
2009.Computational complexity: a modern approach
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Multi-Winner Voting Games in TU and NTU: When is the Core Always Non-Empty?
Defines multi-winner voting games in TU and NTU, then analyzes core non-emptiness and computation for AV, SAV, CC, and PAV under approval utilities.