Gösta Mittag-Leffler

Stubhaug, Arild

doi:10.1007/978-3-642-11672-8

Cited by 17 publications

(2 citation statements)

References 0 publications

(2 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lars Edvard Phragmén (1863Phragmén ( -1937) was a Swedish mathematician, actuary and insurance executive. He began his mathematical university studies in Uppsala in 1882, but transferred in 1883 to Stockholm, where he became a student (and later confidant) of Gösta Mittag-Leffler [63]. In 1888, Phragmén was appointed coeditor of Mittag-Leffler's journal Acta Mathematica, where he immediately made an important contribution by finding an error in a paper by Henri Poincaré on the three-body problem.…”

Section: A Brief Biography Of Phragménmentioning

confidence: 99%

“…Moreover, he was a member of the Royal Commission on a Proportional Election Method 1902-1903 and of a new Royal Commission on the Proportional Election Method 1912-1913. For further information we refer the reader to the survey by Janson [26] and to the book by Stubhaug [63] (in particular for his relation with Mittag-Leffler).…”

Section: A Brief Biography Of Phragménmentioning

confidence: 99%

See 1 more Smart Citation

Phragmén’s voting methods and justified representation

Brill,

Freeman,

Janson

et al. 2023

Math. Program.

View full text Add to dashboard Buy / Rent full text

In the late 19th century, Swedish mathematician Edvard Phragmén proposed a load-balancing approach for selecting committees based on approval ballots. We consider three committee voting rules resulting from this approach: two optimization variants—one minimizing the maximum load and one minimizing the variance of loads—and a sequential variant. We study Phragmén ’s methods from an axiomatic point of view, focusing on properties capturing proportional representation. We show that the sequential variant satisfies proportional justified representation, which is a rare property for committee monotonic methods. Moreover, we show that the optimization variants satisfy perfect representation. We also analyze the computational complexity of Phragmén ’s methods and provide mixed-integer programming based algorithms for computing them.

show abstract

Section: A Brief Biography Of Phragménmentioning

confidence: 99%

Section: A Brief Biography Of Phragménmentioning

confidence: 99%