English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In the late 19th century, Swedish mathematician Lars Edvard Phragm\'{e}nproposed a load-balancing approach for selecting committees based on approvalballots. We consider three committee voting rules resulting from this approach:two optimization variants - one minimizing the maximal load and one minimizingthe variance of loads - and a sequential variant. We study Phragm\'{e}n'smethods from an axiomatic point of view, focusing on properties capturingproportional representation. We show that the sequential variant satisfiesproportional justified representation, which is a rare property for committeemonotonic methods. Moreover, we show that the optimization variants satisfyperfect representation. We also analyze the computational complexity ofPhragm\'{e}n's methods and provide mixed-integer programming based algorithmsfor computing them.

Phragm\'{e}n's Voting Methods and Justified Representation