Advanced search
1 file | 108.86 KB

A threshold for majority in the context of aggregating partial order relations

Michaël Rademaker (UGent) and Bernard De Baets (UGent)
Author
Organization
Abstract
We consider a voting problem where voters have expressed their preferences on a single set of objects. These preferences take the shape of strict partial order relations. In order to allow extraction of a unique strict partial order relation corresponding to a social set of preferences, we determine the minimum number of votes a pairwise preference should receive in order to qualify as a social pairwise preference. Transitive closure of the social pairwise preferences will result in the social set of preferences. At the same time, the social set of preferences needs to be cycle-free, and the minimum number of votes should be determined with this constraint in mind. We provide an example application.
Keywords
T-TRANSITIVE CLOSURES, SOCIAL CHOICE FUNCTIONS

Downloads

  • WCCI2010 rademaker rev final.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 108.86 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Rademaker, Michaël, and Bernard De Baets. 2010. “A Threshold for Majority in the Context of Aggregating Partial Order Relations.” In IEEE International Conference on Fuzzy Systems. New York, NY, USA: IEEE.
APA
Rademaker, M., & De Baets, B. (2010). A threshold for majority in the context of aggregating partial order relations. IEEE International Conference on Fuzzy Systems. Presented at the 2010 IEEE World congress on Computational Intelligence ; 2010 IEEE International conference on Fuzzy Systems (FUZZ-IEEE 2010), New York, NY, USA: IEEE.
Vancouver
1.
Rademaker M, De Baets B. A threshold for majority in the context of aggregating partial order relations. IEEE International Conference on Fuzzy Systems. New York, NY, USA: IEEE; 2010.
MLA
Rademaker, Michaël, and Bernard De Baets. “A Threshold for Majority in the Context of Aggregating Partial Order Relations.” IEEE International Conference on Fuzzy Systems. New York, NY, USA: IEEE, 2010. Print.
@inproceedings{2914462,
  abstract     = {We consider a voting problem where voters have expressed their preferences on a single set of objects. These preferences take the shape of strict partial order relations. In order to allow extraction of a unique strict partial order relation corresponding to a social set of preferences, we determine the minimum number of votes a pairwise preference should receive in order to qualify as a social pairwise preference. Transitive closure of the social pairwise preferences will result in the social set of preferences. At the same time, the social set of preferences needs to be cycle-free, and the minimum number of votes should be determined with this constraint in mind. We provide an example application.},
  author       = {Rademaker, Micha{\"e}l and De Baets, Bernard},
  booktitle    = {IEEE International Conference on Fuzzy Systems},
  isbn         = {9781424469192},
  issn         = {1098-7584},
  keyword      = {T-TRANSITIVE CLOSURES,SOCIAL CHOICE FUNCTIONS},
  language     = {eng},
  location     = {Barcelona, Spain},
  pages        = {4},
  publisher    = {IEEE},
  title        = {A threshold for majority in the context of aggregating partial order relations},
  url          = {http://dx.doi.org/10.1109/FUZZY.2010.5584342},
  year         = {2010},
}

Altmetric
View in Altmetric
Web of Science
Times cited: