Research map / Learning theory and algorithms / Submodular and game algorithms
Fairness in Repeated Matching: A Maximin Perspective
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Promoting Fairness Among Dynamic Agents in Online-Matching Markets under Known Stationary Arrival Distributions (NeurIPS 2024 · similarity 0.89)
- Repeated Fair Allocation of Indivisible Items (AAAI 2024 · similarity 0.88)
- Active Ranking and Matchmaking, with Perfect Matchings (ICML 2024 · similarity 0.88)
- Fairness and Efficiency in Online Class Matching (NeurIPS 2024 · similarity 0.88)
- Stochastic Matching Bandits with Rare Optimization Updates (NeurIPS 2026 · similarity 0.87)
- Stable Matching with Ties: Approximation Ratios and Learning (NeurIPS 2025 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.