Phragmén’s voting methods and justified representation (English)
Free access
- New search for: Brill, Markus
- Further information on Brill, Markus:
-
https://orcid.org/http://orcid.org/0000-0001-9509-7017
- New search for: Freeman, Rupert
- Further information on Freeman, Rupert:
-
https://orcid.org/http://orcid.org/0000-0003-4744-9449
- New search for: Janson, Svante
- Further information on Janson, Svante:
-
https://orcid.org/http://orcid.org/0000-0002-9680-2790
- New search for: Lackner, Martin
- Further information on Lackner, Martin:
-
https://orcid.org/http://orcid.org/0000-0003-2170-0770
- New search for: Brill, Markus
- Further information on Brill, Markus:
-
https://orcid.org/http://orcid.org/0000-0001-9509-7017
- New search for: Freeman, Rupert
- Further information on Freeman, Rupert:
-
https://orcid.org/http://orcid.org/0000-0003-4744-9449
- New search for: Janson, Svante
- Further information on Janson, Svante:
-
https://orcid.org/http://orcid.org/0000-0002-9680-2790
- New search for: Lackner, Martin
- Further information on Lackner, Martin:
-
https://orcid.org/http://orcid.org/0000-0003-2170-0770
In:
Mathematical Programming
: A Publication of the Mathematical Optimization Society
;
203
, 1-2
;
47-76
;
2024
- Article (Journal) / Electronic Resource
-
Title:Phragmén’s voting methods and justified representation
-
Additional title:Math. Program.
-
Contributors:Brill, Markus ( author ) / Freeman, Rupert ( author ) / Janson, Svante ( author ) / Lackner, Martin ( author )
-
Published in:Mathematical Programming : A Publication of the Mathematical Optimization Society ; 203, 1-2 ; 47-76
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin/Heidelberg
-
Publication date:2024-01-01
-
Size:30 pages
-
ISSN:
-
DOI:
-
Type of media:Article (Journal)
-
Type of material:Electronic Resource
-
Language:English
- New search for: 91B14
- Further information on Mathematics Subject Classification
-
Keywords:
-
Classification:
MSC: 91B14 -
Licence:
-
Source:
Table of contents – Volume 203, Issue 1-2
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Mathematical Optimization for Fair Social Decisions: A Tribute to Michel BalinskiBaïou, Mourad / Correa, José / Laraki, Rida et al. | 2024
- 9
-
Optimality and fairness of partisan gerrymanderingLagarde, Antoine / Tomala, Tristan et al. | 2024
- 47
-
Phragmén’s voting methods and justified representationBrill, Markus / Freeman, Rupert / Janson, Svante / Lackner, Martin et al. | 2024
- 77
-
Approval-based apportionmentBrill, Markus / Gölz, Paul / Peters, Dominik / Schmidt-Kraepelin, Ulrike / Wilker, Kai et al. | 2024
- 107
-
The maximin support method: an extension of the D’Hondt method to approval-based multiwinner electionsSánchez-Fernández, Luis / Fernández-García, Norberto / Fisteus, Jesús A. / Brill, Markus et al. | 2024
- 135
-
Apportionment with parity constraintsMathieu, Claire / Verdugo, Victor et al. | 2024
- 169
-
Note on axiomatic properties of apportionment methods for proportional representation systemsPalomares, Antonio / Pukelsheim, Friedrich / Ramírez, Victoriano et al. | 2024
- 187
-
A simple and fast linear-time algorithm for divisor methods of apportionmentReitzig, Raphael / Wild, Sebastian et al. | 2024
- 207
-
New characterizations of strategy-proofness under single-peakednessJennings, Andrew B. / Laraki, Rida / Puppe, Clemens / Varloot, Estelle M. et al. | 2024
- 239
-
Why webster?Balinski, Michel / Ramírez, Victoriano et al. | 2024
- 247
-
Cutoff stability under distributional constraints with an application to summer internship matchingAziz, Haris / Baychkov, Anton / Biró, Péter et al. | 2024
- 271
-
How many matchings cover the nodes of a graph?Ferhat, Dehia Ait / Király, Zoltán / Sebő, András / Stauffer, Gautier et al. | 2024
- 285
-
Fairness over time in dynamic resource allocation with an application in healthcareLodi, Andrea / Olivier, Philippe / Pesant, Gilles / Sankaranarayanan, Sriram et al. | 2024
- 319
-
Approximate and strategyproof maximin share allocation of chores with ordinal preferencesAziz, Haris / Li, Bo / Wu, Xiaowei et al. | 2024
- 347
-
Identifying optimal strategies in kidney exchange games is Σ2p-completeSmeulders, B. / Blom, D. A. M. P. / Spieksma, F. C. R. et al. | 2024
- 369
-
Graphs with Gp-connected mediansBénéteau, Laurine / Chalopin, Jérémie / Chepoi, Victor / Vaxès, Yann et al. | 2024
- 421
-
On the minimum s-t cut problem with budget constraintsAissi, Hassene / Mahjoub, A. Ridha et al. | 2024
- 443
-
The computation of pairwise stable networksHerings, P. Jean-Jacques / Zhan, Yang et al. | 2024
- 475
-
Correction to: The computation of pairwise stable networksHerings, P. Jean-Jacques / Zhan, Yang et al. | 2024
- 477
-
Splitting games over finite setsKoessler, Frédéric / Laclau, Marie / Renault, Jérôme / Tomala, Tristan et al. | 2024
- 499
-
The price of Anarchy in series-parallel network congestion gamesHao, Bainian / Michini, Carla et al. | 2024
- 531
-
The price of anarchy in routing games as a function of the demandCominetti, Roberto / Dose, Valerio / Scarsini, Marco et al. | 2024
- 559
-
A unified stochastic approximation framework for learning in gamesMertikopoulos, Panayotis / Hsieh, Ya-Ping / Cevher, Volkan et al. | 2024
- 611
-
Strong substitutes: structural properties, and a new algorithm for competitive equilibrium pricesBaldwin, Elizabeth / Bichler, Martin / Fichtl, Maximilian / Klemperer, Paul et al. | 2024
- 645
-
No-regret algorithms in on-line learning, games and convex optimizationSorin, Sylvain et al. | 2024
- 687
-
The core of a transferable utility game as the solution to a public good market demand problemEdelman, Paul H. / Van der Linden, Martin / Weymark, John A. et al. | 2024
- 703
-
Utility/privacy trade-off as regularized optimal transportBoursier, Etienne / Perchet, Vianney et al. | 2024
- 727
-
A finite characterization of perfect equilibriaCallejas, Ivonne / Govindan, Srihari / Pahl, Lucas et al. | 2024
- 735
-
Absorption paths and equilibria in quitting gamesAshkenazi-Golan, Galit / Krasikov, Ilia / Rainer, Catherine / Solan, Eilon et al. | 2024
- 763
-
Stackelberg pricing games with congestion effectsHarks, Tobias / Schedel, Anja et al. | 2024
- 801
-
Characterization of TU games with stable cores by nested balancednessGrabisch, Michel / Sudhölter, Peter et al. | 2024
- 827
-
On the resolution of cross-liabilitiesDemange, Gabrielle et al. | 2024
- 857
-
Consistent queueing rulesThomson, William / Velez, Rodrigo A. et al. | 2024
- 871
-
Truthful ownership transfer with expert adviceCaragiannis, Ioannis / Filos-Ratsikas, Aris / Nath, Swaprava / Voudouris, Alexandros A. et al. | 2024
- 901
-
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorshipCaragiannis, Ioannis / Filos-Ratsikas, Aris / Frederiksen, Søren Kristoffer Stiil / Hansen, Kristoffer Arnsfelt / Tan, Zihan et al. | 2024
- 931
-
Fair division of graphs and of tangled cakesIgarashi, Ayumi / Zwicker, William S. et al. | 2024