Carregant...
Carregant...

Vés al contingut (premeu Retorn)

On May's theorem extension for anonymous voting rules

Autor
Freixas, J.; Pons, M.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
Quantitative methods of group decision making
Any de l'edició
2016
Data de presentació
2016-11-25
Resum
Boolean functions assign a binary output to any vector of binary components. We extend this notion to (j,k)-functions, which assign an output among k choices to any multi-level vector with j choices for each component. We center our attention to the anonymous (j,k)-functions. For them we obtain a closed formula to enumerate all anonymous (2,k)-functions and we extend May's theorem to (j,3)-functions.
Paraules clau
Discrete Multilevel Functions, Boolean Functions, Threshold Multilevel Functions, Anonymous Multilevel Functions, Enumerations.\\
Grup de recerca
GRTJ - Grup de Recerca en Teoria de Jocs

Participants