On the subgame perfect implementabılıty of voting rules.
Matías NúñezM. Remzi SanverPublished in: Soc. Choice Welf. (2021)
Keyphrases
- scoring rules
- subgame perfect
- nash equilibria
- voting rules
- nash equilibrium
- computational social choice
- computationally hard
- game theory
- game theoretic
- incomplete information
- partial order
- special case
- cartesian product
- computational complexity
- winner determination
- np hard
- rank aggregation
- social choice
- worst case
- pairwise comparisons
- np hardness
- multi agent
- social network analysis
- information retrieval systems
- weighted majority
- dynamic programming