2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 1-152, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@Proceedings{ligett_et_al:LIPIcs.FORC.2021, title = {{LIPIcs, Volume 192, FORC 2021, Complete Volume}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {1--152}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021}, URN = {urn:nbn:de:0030-drops-138675}, doi = {10.4230/LIPIcs.FORC.2021}, annote = {Keywords: LIPIcs, Volume 192, FORC 2021, Complete Volume} }
2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 0:i-0:viii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ligett_et_al:LIPIcs.FORC.2021.0, author = {Ligett, Katrina and Gupta, Swati}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {0:i--0:viii}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.0}, URN = {urn:nbn:de:0030-drops-138680}, doi = {10.4230/LIPIcs.FORC.2021.0}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Arun Ganesh and Jiazheng Zhao. Privately Answering Counting Queries with Generalized Gaussian Mechanisms. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 1:1-1:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ganesh_et_al:LIPIcs.FORC.2021.1, author = {Ganesh, Arun and Zhao, Jiazheng}, title = {{Privately Answering Counting Queries with Generalized Gaussian Mechanisms}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {1:1--1:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.1}, URN = {urn:nbn:de:0030-drops-138698}, doi = {10.4230/LIPIcs.FORC.2021.1}, annote = {Keywords: Differential privacy, counting queries, Generalized Gaussians} }
Christopher Jung, Michael Kearns, Seth Neel, Aaron Roth, Logan Stapleton, and Zhiwei Steven Wu. An Algorithmic Framework for Fairness Elicitation. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 2:1-2:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{jung_et_al:LIPIcs.FORC.2021.2, author = {Jung, Christopher and Kearns, Michael and Neel, Seth and Roth, Aaron and Stapleton, Logan and Wu, Zhiwei Steven}, title = {{An Algorithmic Framework for Fairness Elicitation}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {2:1--2:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.2}, URN = {urn:nbn:de:0030-drops-138701}, doi = {10.4230/LIPIcs.FORC.2021.2}, annote = {Keywords: Fairness, Fairness Elicitation} }
Vincent Cohen-Addad, Philip N. Klein, Dániel Marx, Archer Wheeler, and Christopher Wolfram. On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 3:1-3:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cohenaddad_et_al:LIPIcs.FORC.2021.3, author = {Cohen-Addad, Vincent and Klein, Philip N. and Marx, D\'{a}niel and Wheeler, Archer and Wolfram, Christopher}, title = {{On the Computational Tractability of a Geographic Clustering Problem Arising in Redistricting}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {3:1--3:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.3}, URN = {urn:nbn:de:0030-drops-138718}, doi = {10.4230/LIPIcs.FORC.2021.3}, annote = {Keywords: redistricting, algorithms, planar graphs, lower bounds} }
Claire Lazar Reich and Suhas Vijaykumar. A Possibility in Algorithmic Fairness: Can Calibration and Equal Error Rates Be Reconciled?. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 4:1-4:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{lazarreich_et_al:LIPIcs.FORC.2021.4, author = {Lazar Reich, Claire and Vijaykumar, Suhas}, title = {{A Possibility in Algorithmic Fairness: Can Calibration and Equal Error Rates Be Reconciled?}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {4:1--4:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.4}, URN = {urn:nbn:de:0030-drops-138727}, doi = {10.4230/LIPIcs.FORC.2021.4}, annote = {Keywords: fair prediction, impossibility results, screening decisions, classification, calibration, equalized odds, optimal transport, risk scores} }
Aloni Cohen, Moon Duchin, JN Matthews, and Bhushan Suwal. Census TopDown: The Impacts of Differential Privacy on Redistricting. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 5:1-5:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{cohen_et_al:LIPIcs.FORC.2021.5, author = {Cohen, Aloni and Duchin, Moon and Matthews, JN and Suwal, Bhushan}, title = {{Census TopDown: The Impacts of Differential Privacy on Redistricting}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {5:1--5:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.5}, URN = {urn:nbn:de:0030-drops-138736}, doi = {10.4230/LIPIcs.FORC.2021.5}, annote = {Keywords: Census, TopDown, differential privacy, redistricting, Voting Rights Act} }
Emily Diana, Wesley Gill, Ira Globus-Harris, Michael Kearns, Aaron Roth, and Saeed Sharifi-Malvajerdi. Lexicographically Fair Learning: Algorithms and Generalization. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{diana_et_al:LIPIcs.FORC.2021.6, author = {Diana, Emily and Gill, Wesley and Globus-Harris, Ira and Kearns, Michael and Roth, Aaron and Sharifi-Malvajerdi, Saeed}, title = {{Lexicographically Fair Learning: Algorithms and Generalization}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {6:1--6:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.6}, URN = {urn:nbn:de:0030-drops-138748}, doi = {10.4230/LIPIcs.FORC.2021.6}, annote = {Keywords: Fair Learning, Lexicographic Fairness, Online Learning, Game Theory} }
Ke Yang, Joshua R. Loftus, and Julia Stoyanovich. Causal Intersectionality and Fair Ranking. In 2nd Symposium on Foundations of Responsible Computing (FORC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 192, pp. 7:1-7:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{yang_et_al:LIPIcs.FORC.2021.7, author = {Yang, Ke and Loftus, Joshua R. and Stoyanovich, Julia}, title = {{Causal Intersectionality and Fair Ranking}}, booktitle = {2nd Symposium on Foundations of Responsible Computing (FORC 2021)}, pages = {7:1--7:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-187-0}, ISSN = {1868-8969}, year = {2021}, volume = {192}, editor = {Ligett, Katrina and Gupta, Swati}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2021.7}, URN = {urn:nbn:de:0030-drops-138756}, doi = {10.4230/LIPIcs.FORC.2021.7}, annote = {Keywords: fairness, intersectionality, ranking, causality} }
Feedback for Dagstuhl Publishing