In multiwinner approval voting, the goal is to select a
k
-member committee based on voters’ approval ballots. A well-studied concept of proportionality in this context is the
justified representation (JR)
axiom, which demands that no large cohesive group of voters remains unrepresented. However, the JR axiom may conflict with other desiderata, such as
social welfare
(the number of approvals obtained by committee members) or
coverage
(the number of voters who approve at least one committee member). In this article, we investigate the price of imposing the JR axiom (as well as the more demanding
extended justified representation (EJR)
axiom) on social welfare and coverage. Our approach is twofold: we derive worst-case bounds on the loss of welfare/coverage caused by imposing JR, and study the computational complexity of finding committees with high welfare that provide JR (obtaining hardness results, approximation algorithms, and an exact algorithm for one-dimensional preferences).