Proportionally Fair Matching with Multiple Groups

DOI10.1007/978-3-031-43380-1_1MaRDI QIDQ6496539zbMATH OpenFDO

Authors Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Kirill Simonov

Publication date 3 May 2024

Full work available at URL https://doi.org/10.1007/978-3-031-43380-1_1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A parameterized view on matroid optimization problems
• Algorithms – ESA 2004
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
• Approximate multi-matroid intersection via iterative refinement
• Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Color-coding
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Controlled school choice with soft bounds and overlapping types
• Fair matchings and related problems
• Fair-by-design matching
• Fairness through awareness
• Fairness under composition
• Hitting forbidden subgraphs in graphs of bounded treewidth
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 6866333 (Why is no real title available?)
• Matching theory
• Maximum matchings in general graphs through randomization
• Node-and edge-deletion NP-complete problems
• On the complexity of k-SAT
• Parameterized algorithms and kernels for rainbow matching
• Paths, Trees, and Flowers
• Procedurally fair and stable matching

Cited in

(1)

• Determinantal sieving

This page was built for publication: Proportionally Fair Matching with Multiple Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496539)