Preference Distribution Algorithms

Preference Distribution Algorithms is a computational method in vote tabulation that systematically allocates and redistributes voter preferences among candidates according to predefined rules, distinguishing it from other tabulation methods by its focus on iteratively reallocated ranked or scored preferences to determine winners in proportional or preferential voting systems.

39

Publications

1.2K

Citations

88

Authors

59

Institutions

Publications per year

2017–2026

11

Authors

88

  1. DP
    Dominik Peters

    University of Oxford, United Kingdom

    5 publications · 132 citations

    5

    h-index

  2. ML
    Martin Lackner

    TU Wien, Austria

    2 publications · 60 citations

    2

    h-index

  3. ML
    Michael L. Littman

    Rutgers, The State University of New Jersey, United States

    2 publications · 46 citations

    2

    h-index

  4. XG
    Xin Geng

    Southeast University, China

    2 publications · 66 citations

    2

    h-index

  5. AS
    Arkadii Slinko

    University of Auckland, New Zealand

    2 publications · 22 citations

    2

    h-index

1–5 of 88

Venues

  1. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 4 publications · 91 citations

    4

    h-index

  2. Social Choice and Welfare

    2 publications · 35 citations

    2

    h-index

  3. arXiv (Cornell University)

    Repository · 2 publications · 58 citations

    2

    h-index

  4. Artificial Intelligence

    2 publications · 53 citations

    2

    h-index

  5. Social Networks

    1 publications · 87 citations

    1

    h-index

1–5