LIPIcs, Volume 192
FORC 2021, June 9-11, 2021, Virtual Conference
Editors: Katrina Ligett and Swati Gupta
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 192, 2nd Symposium on Foundations of Responsible Computing (FORC 2021)
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-dev.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} }
Published in: LIPIcs, Volume 156, 1st Symposium on Foundations of Responsible Computing (FORC 2020)
Katrina Ligett, Charlotte Peale, and Omer Reingold. Bounded-Leakage Differential Privacy. In 1st Symposium on Foundations of Responsible Computing (FORC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 156, pp. 10:1-10:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{ligett_et_al:LIPIcs.FORC.2020.10, author = {Ligett, Katrina and Peale, Charlotte and Reingold, Omer}, title = {{Bounded-Leakage Differential Privacy}}, booktitle = {1st Symposium on Foundations of Responsible Computing (FORC 2020)}, pages = {10:1--10:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-142-9}, ISSN = {1868-8969}, year = {2020}, volume = {156}, editor = {Roth, Aaron}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2020.10}, URN = {urn:nbn:de:0030-drops-120265}, doi = {10.4230/LIPIcs.FORC.2020.10}, annote = {Keywords: differential privacy, applications, privacy, leakage, auxiliary information} }
Published in: LIPIcs, Volume 151, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020)
Christopher Jung, Katrina Ligett, Seth Neel, Aaron Roth, Saeed Sharifi-Malvajerdi, and Moshe Shenfeld. A New Analysis of Differential Privacy’s Generalization Guarantees. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 151, pp. 31:1-31:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{jung_et_al:LIPIcs.ITCS.2020.31, author = {Jung, Christopher and Ligett, Katrina and Neel, Seth and Roth, Aaron and Sharifi-Malvajerdi, Saeed and Shenfeld, Moshe}, title = {{A New Analysis of Differential Privacy’s Generalization Guarantees}}, booktitle = {11th Innovations in Theoretical Computer Science Conference (ITCS 2020)}, pages = {31:1--31:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-134-4}, ISSN = {1868-8969}, year = {2020}, volume = {151}, editor = {Vidick, Thomas}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2020.31}, URN = {urn:nbn:de:0030-drops-117165}, doi = {10.4230/LIPIcs.ITCS.2020.31}, annote = {Keywords: Differential Privacy, Adaptive Data Analysis, Transfer Theorem} }
Published in: Dagstuhl Seminar Proceedings, Volume 9511, Parameterized complexity and approximation algorithms (2010)
Kunal Talwar, Anupam Gupta, Katrina Ligett, Frank McSherry, and Aaron Roth. Differentially Private Combinatorial Optimization. In Parameterized complexity and approximation algorithms. Dagstuhl Seminar Proceedings, Volume 9511, pp. 1-31, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
@InProceedings{talwar_et_al:DagSemProc.09511.6, author = {Talwar, Kunal and Gupta, Anupam and Ligett, Katrina and McSherry, Frank and Roth, Aaron}, title = {{Differentially Private Combinatorial Optimization}}, booktitle = {Parameterized complexity and approximation algorithms}, pages = {1--31}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2010}, volume = {9511}, editor = {Erik D. Demaine and MohammadTaghi Hajiaghayi and D\'{a}niel Marx}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09511.6}, URN = {urn:nbn:de:0030-drops-24986}, doi = {10.4230/DagSemProc.09511.6}, annote = {Keywords: Differential Privacy, Approximation Algorithms} }
Feedback for Dagstuhl Publishing