Group Fairness: From Multiwinner Voting to Participatory Budgeting

Edith Elkind

doi:10.4230/LIPIcs.ISAAC.2023.1

Group Fairness: From Multiwinner Voting to Participatory Budgeting

Edith Elkind^*

^*Corresponding author for this work

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Many cities around the world allocate a part of their budget based on residents’ votes, following a process known as participatory budgeting. It is important to understand which outcomes of this process should be viewed as fair, and whether fair outcomes could be computed efficiently. We summarise recent progress on this topic. We first focus on a special case of participatory budgeting where all candidate projects have the same cost (known as multiwinner voting), formulate progressively more demanding notions of fairness for this setting, and identify efficiently computable voting rules that satisfy them. We then discuss the challenges of extending these ideas to the general model.

Original language	English (US)
Title of host publication	34th International Symposium on Algorithms and Computation, ISAAC 2023
Editors	Satoru Iwata, Satoru Iwata, Naonori Kakimura
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959772891
DOIs	https://doi.org/10.4230/LIPIcs.ISAAC.2023.1
State	Published - Dec 2023
Event	34th International Symposium on Algorithms and Computation, ISAAC 2023 - Kyoto, Japan Duration: Dec 3 2023 → Dec 6 2023

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	283
ISSN (Print)	1868-8969

Conference

Conference	34th International Symposium on Algorithms and Computation, ISAAC 2023
Country/Territory	Japan
City	Kyoto
Period	12/3/23 → 12/6/23

Keywords

justified representation
multiwinner voting
participatory budgeting

ASJC Scopus subject areas

Software

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

Access to Document

10.4230/LIPIcs.ISAAC.2023.1

Cite this

Elkind, E. (2023). Group Fairness: From Multiwinner Voting to Participatory Budgeting. In S. Iwata, S. Iwata, & N. Kakimura (Eds.), 34th International Symposium on Algorithms and Computation, ISAAC 2023 Article 1 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 283). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ISAAC.2023.1

@inproceedings{883c60ce64c84d21ae59955b6360a4d3,

title = "Group Fairness: From Multiwinner Voting to Participatory Budgeting",

abstract = "Many cities around the world allocate a part of their budget based on residents{\textquoteright} votes, following a process known as participatory budgeting. It is important to understand which outcomes of this process should be viewed as fair, and whether fair outcomes could be computed efficiently. We summarise recent progress on this topic. We first focus on a special case of participatory budgeting where all candidate projects have the same cost (known as multiwinner voting), formulate progressively more demanding notions of fairness for this setting, and identify efficiently computable voting rules that satisfy them. We then discuss the challenges of extending these ideas to the general model.",

keywords = "justified representation, multiwinner voting, participatory budgeting",

author = "Edith Elkind",

note = "Publisher Copyright: {\textcopyright} Edith Elkind; licensed under Creative Commons License CC-BY 4.0.; 34th International Symposium on Algorithms and Computation, ISAAC 2023 ; Conference date: 03-12-2023 Through 06-12-2023",

year = "2023",

month = dec,

doi = "10.4230/LIPIcs.ISAAC.2023.1",

language = "English (US)",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Satoru Iwata and Satoru Iwata and Naonori Kakimura",

booktitle = "34th International Symposium on Algorithms and Computation, ISAAC 2023",

}

Elkind, E 2023, Group Fairness: From Multiwinner Voting to Participatory Budgeting. in S Iwata, S Iwata & N Kakimura (eds), 34th International Symposium on Algorithms and Computation, ISAAC 2023., 1, Leibniz International Proceedings in Informatics, LIPIcs, vol. 283, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 34th International Symposium on Algorithms and Computation, ISAAC 2023, Kyoto, Japan, 12/3/23. https://doi.org/10.4230/LIPIcs.ISAAC.2023.1

Group Fairness: From Multiwinner Voting to Participatory Budgeting. / Elkind, Edith.
34th International Symposium on Algorithms and Computation, ISAAC 2023. ed. / Satoru Iwata; Satoru Iwata; Naonori Kakimura. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2023. 1 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 283).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Group Fairness

T2 - 34th International Symposium on Algorithms and Computation, ISAAC 2023

AU - Elkind, Edith

PY - 2023/12

Y1 - 2023/12

N2 - Many cities around the world allocate a part of their budget based on residents’ votes, following a process known as participatory budgeting. It is important to understand which outcomes of this process should be viewed as fair, and whether fair outcomes could be computed efficiently. We summarise recent progress on this topic. We first focus on a special case of participatory budgeting where all candidate projects have the same cost (known as multiwinner voting), formulate progressively more demanding notions of fairness for this setting, and identify efficiently computable voting rules that satisfy them. We then discuss the challenges of extending these ideas to the general model.

AB - Many cities around the world allocate a part of their budget based on residents’ votes, following a process known as participatory budgeting. It is important to understand which outcomes of this process should be viewed as fair, and whether fair outcomes could be computed efficiently. We summarise recent progress on this topic. We first focus on a special case of participatory budgeting where all candidate projects have the same cost (known as multiwinner voting), formulate progressively more demanding notions of fairness for this setting, and identify efficiently computable voting rules that satisfy them. We then discuss the challenges of extending these ideas to the general model.

KW - justified representation

KW - multiwinner voting

KW - participatory budgeting

UR - http://www.scopus.com/inward/record.url?scp=85179134217&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85179134217&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ISAAC.2023.1

DO - 10.4230/LIPIcs.ISAAC.2023.1

M3 - Conference contribution

AN - SCOPUS:85179134217

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 34th International Symposium on Algorithms and Computation, ISAAC 2023

A2 - Iwata, Satoru

A2 - Kakimura, Naonori

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

Y2 - 3 December 2023 through 6 December 2023

ER -

Group Fairness: From Multiwinner Voting to Participatory Budgeting

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

UN SDGs

Access to Document

Other files and links

Fingerprint

Cite this