On swap convexity of voting rules
Obraztsova et al. (2013) have recently proposed an intriguing convexity axiom for voting rules. This axiom imposes conditions on the shape of the sets of elections with a given candidate as a winner. However, this new axiom is both too weak and too strong: it is too weak because it defines a set to...
Asıl Yazarlar: | Obraztsova, S, Elkind, E, Faliszewski, P |
---|---|
Materyal Türü: | Conference item |
Dil: | English |
Baskı/Yayın Bilgisi: |
AAAI Press
2020
|
Benzer Materyaller
-
On swap−distance geometry of voting rules
Yazar:: Obraztsova, S, ve diğerleri
Baskı/Yayın Bilgisi: (2013) -
Distance rationalization of voting rules.
Yazar:: Elkind, E, ve diğerleri
Baskı/Yayın Bilgisi: (2015) -
Distance rationalization of voting rules
Yazar:: Elkind, E, ve diğerleri
Baskı/Yayın Bilgisi: (2015) -
Properties of multiwinner voting rules
Yazar:: Elkind, E, ve diğerleri
Baskı/Yayın Bilgisi: (2017) -
Properties of Multiwinner Voting Rules
Yazar:: Elkind, E, ve diğerleri
Baskı/Yayın Bilgisi: (2014)