Research map / Learning theory and algorithms / Submodular and game algorithms
Blind, Greedy, and Random: Algorithms for Matching and Clustering Using Only Ordinal Information
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| interleave greedy matching on two thirds of agents with random matching, instead of purely greedy or purely random | ordinal maximum weighted matching with metric weights · Metric MWM | approximation factor: 2 -> 1.6 | Helped |
Closest papers by meaning
- Active Ranking and Matchmaking, with Perfect Matchings (ICML 2024 · similarity 0.88)
- Low-Distortion Clustering with Ordinal and Limited Cardinal Information (AAAI 2024 · similarity 0.88)
- Fairness and Efficiency in Online Class Matching (NeurIPS 2024 · similarity 0.86)
- Fair and Welfare-Efficient Constrained Multi-Matchings under Uncertainty (NeurIPS 2024 · similarity 0.86)
- MATWA: A Web Toolkit for Matching Under Preferences (AAAI 2025 · similarity 0.86)
- Proportional Fairness in Clustering: A Social Choice Perspective (NeurIPS 2024 · similarity 0.86)
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.