Falmagne and Regenwetter (1996) proposed a probabilistic choice model of approval voting called the size-independent model. This model was investigated geometrically by Doignon and Regenwetter (1997), who introduced the approval-voting polytope associated with the choice model. In an effort to get closer to a full linear description of the polytope, we provide all edges, two-dimensional faces, and a large group of combinatorial automorphisms. Despite the new insights gathered from these results, the main challenge of listing all facets remains an open problem. © 2002 Elsevier Science (USA).SCOPUS: ar.jinfo:eu-repo/semantics/publishe
One way of computing the probability of a specific voting situation under the Im-partial Anonymous C...
ABSTRACT. A natural partial ordering exists on all weighted games and, more broadly, on all linear g...
We study computational aspects of three prominent voting rules that use approval ballots to select m...
AbstractCharacterizing the size-independent model for approval voting of Falmagne and Regenwetter (J...
A probabilistic model of approval voting onnalternatives generates a collection of probability distr...
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free ...
We propose a new class of voting rules, called Size Approval Voting. According to this rule, the efe...
We propose a new class of voting rules, called Size Approval Voting. According to this rule, the eff...
Approval voting is an election method in which voters may cast votes for as many candidates as they ...
L'objet de cette thèse est l'étude des aspects algorithmiques du vote par approbation. Il s'agit pri...
Many hard computational social choice problems are known to become tractable when voters ’ pref-eren...
Abstract Among many other topics, Hannu Nurmi has worked on voting para-doxes and how to deal with t...
Abstract. ‘‘Subset voting’ ’ denotes a choice situation where one fixed set of choice alternatives (...
We propose a new class of voting rules, called Size Approval Voting. According to this rule, the eff...
Approval voting features are analysed in a context of large elections with strategic voters: Myerson...
One way of computing the probability of a specific voting situation under the Im-partial Anonymous C...
ABSTRACT. A natural partial ordering exists on all weighted games and, more broadly, on all linear g...
We study computational aspects of three prominent voting rules that use approval ballots to select m...
AbstractCharacterizing the size-independent model for approval voting of Falmagne and Regenwetter (J...
A probabilistic model of approval voting onnalternatives generates a collection of probability distr...
Mathematical psychology has a long tradition of modeling probabilistic choice via distribution-free ...
We propose a new class of voting rules, called Size Approval Voting. According to this rule, the efe...
We propose a new class of voting rules, called Size Approval Voting. According to this rule, the eff...
Approval voting is an election method in which voters may cast votes for as many candidates as they ...
L'objet de cette thèse est l'étude des aspects algorithmiques du vote par approbation. Il s'agit pri...
Many hard computational social choice problems are known to become tractable when voters ’ pref-eren...
Abstract Among many other topics, Hannu Nurmi has worked on voting para-doxes and how to deal with t...
Abstract. ‘‘Subset voting’ ’ denotes a choice situation where one fixed set of choice alternatives (...
We propose a new class of voting rules, called Size Approval Voting. According to this rule, the eff...
Approval voting features are analysed in a context of large elections with strategic voters: Myerson...
One way of computing the probability of a specific voting situation under the Im-partial Anonymous C...
ABSTRACT. A natural partial ordering exists on all weighted games and, more broadly, on all linear g...
We study computational aspects of three prominent voting rules that use approval ballots to select m...