Proportionally Fair Matching with Multiple Groups
From MaRDI portal
Publication:6496539
DOI10.1007/978-3-031-43380-1_1MaRDI QIDQ6496539
Unnamed Author, Fedor V. Fomin, Sayan Bandyapadhyay, Kirill Simonov
Publication date: 3 May 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fair matchings and related problems
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- A parameterized view on matroid optimization problems
- Parameterized algorithms and kernels for rainbow matching
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- An algebraic Monte-Carlo algorithm for the partition adjacency matrix realization problem
- Fair-by-design matching
- Hitting forbidden subgraphs in graphs of bounded treewidth
- Procedurally fair and stable matching
- Fairness through awareness
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions
- Controlled School Choice with Soft Bounds and Overlapping Types
- Maximum matchings in general graphs through randomization
- Deterministic Truncation of Linear Matroids
- Color-coding
- Paths, Trees, and Flowers
- Node-and edge-deletion NP-complete problems
- Algorithms – ESA 2004
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximate multi-matroid intersection via iterative refinement
- On the complexity of \(k\)-SAT
This page was built for publication: Proportionally Fair Matching with Multiple Groups
