We study approval-based apportionment, a variant of committee elections in which candidates ("parties") can be selected several times. We show that the proportionality axioms EJR, EJR+, and FJR coincide, and so do PJR, PJR+, and FPJR; that Lindahl priceability, an axiom implying core stability, is equivalent to a notio...
In this paper, we consider an easy greedy approximation algorithm, the good-bad algorithm, introduced by Cou\"etoux for finding a minimum-cost set of edges such that every connected component has at least $k$ vertices. Cou\"etoux proves that the good-bad algorithm achieves a $3/2$-approximation for this problem. Davis...
Shayan Ranjbarzadeh, David P. Williamson, Hannane Yaghoubizade· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.