Journal article icon

Journal article

Proportional representation in matching markets: selecting multiple matchings under dichotomous preferences

Abstract:
Given a set of agents with approval preferences over each other, we study the task of finding k matchings fairly representing everyone’s preferences. To formalize fairness, we apply the concept of proportional representation as studied in approval-based multiwinner elections. To this end, we model the problem as a multiwinner election where the set of candidates consists of matchings of the agents, and agents’ preferences over each other are lifted to preferences over matchings. Due to the exponential number of candidates in such elections, standard algorithms for classical sequential voting rules (such as those proposed by Thiele and Phragmén) are rendered inefficient. We show that the computational tractability of these rules can be regained by exploiting the structure of the approval preferences. Moreover, we establish algorithmic results and axiomatic guarantees that go beyond those obtainable in the classical approval-based multiwinner setting: Assuming that approvals are symmetric, we show that Proportional Approval Voting (PAV), a well-established but computationally intractable voting rule, becomes polynomial-time computable, and that its sequential variant, which does not provide any proportionality guarantees in general, fulfills a rather strong guarantee known as extended justified representation. Some of our algorithmic results extend to other types of compactly representable elections with an exponential candidate space.
Publication status:
Published
Peer review status:
Peer reviewed

Actions

Access Document

Publisher copy:
10.1007/s00355-023-01453-7

Authors

More by this author
Role:
Author
ORCID:
0000-0001-5102-449X
More by this author
Institution:
University of Oxford
Role:
Author
ORCID:
0000-0001-9509-7017
More by this author
Role:
Author
ORCID:
0000-0002-9213-7746


Publisher:
Springer
Journal:
Social Choice and Welfare More from this journal
Volume:
64
Issue:
1-2
Pages:
179-220
Publication date:
2023-04-05
DOI:
EISSN:
1432-217X
ISSN:
0176-1714


Language:
English
Keywords:
Pubs id:
2377247
Local pid:
pubs:2377247
Source identifiers:
W4362608684
Deposit date:
2026-02-19
ARK identifier:
This ORA record was generated from metadata provided by an external service. It has not been edited by the ORA Team.

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP