Corpus ID: 220546237

Maximizing coverage while ensuring fairness: a tale of conflicting objective

@article{Asudeh2020MaximizingCW,
  title={Maximizing coverage while ensuring fairness: a tale of conflicting objective},
  author={Abolfazl Asudeh and Tanya Berger-Wolf and B. Dasgupta and Anastasios Sidiropoulos},
  journal={ArXiv},
  year={2020},
  volume={abs/2007.08069}
}
  • Abolfazl Asudeh, Tanya Berger-Wolf, +1 author Anastasios Sidiropoulos
  • Published 2020
  • Mathematics, Computer Science
  • ArXiv
  • Ensuring fairness in computational problems has emerged as a $key$ topic during recent years, buoyed by considerations for equitable resource distributions and social justice. It $is$ possible to incorporate fairness in computational problems from several perspectives, such as using optimization, game-theoretic or machine learning frameworks. In this paper we address the problem of incorporation of fairness from a $combinatorial$ $optimization$ perspective. We formulate a combinatorial… CONTINUE READING

    Figures and Tables from this paper

    References

    SHOWING 1-10 OF 60 REFERENCES
    Dependent Randomized Rounding via Exchange Properties of Combinatorial Structures
    • 194
    • PDF
    Learning Fair Representations
    • 728
    • PDF
    Strengthening integrality gaps for capacitated network design and covering problems
    • 223
    • PDF
    Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds
    • 278
    • Highly Influential
    • PDF
    Distributions on level-sets with applications to approximation algorithms
    • A. Srinivasan
    • Computer Science
    • Proceedings 2001 IEEE International Conference on Cluster Computing
    • 2001
    • 131
    • Highly Influential
    Multicolour Discrepancies
    • 40
    An FPT Algorithm Beating 2-Approximation for k-Cut
    • 19
    • PDF
    Primal-Dual Schema for Capacitated Covering Problems
    • 53
    • Highly Influential
    • PDF
    Constructive Algorithms for Discrepancy Minimization
    • N. Bansal
    • Mathematics, Computer Science
    • 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
    • 2010
    • 136
    • PDF
    A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation
    • 13
    • Highly Influential
    • PDF