Research map / Learning theory and algorithms / Submodular and game algorithms
The Conference Paper Assignment Problem: Using Order Weighted Averages to Assign Indivisible Goods
Jing Wu Lian, Nicholas Mattei, Renee Noble, Toby Walsh
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 |
|---|---|---|---|
| Use the harmonic Σ-OWA objective instead of the utilitarian objective | Conference paper assignment · MD-00002-00000003 | agents receiving 5 top-ranked papers: 46 -> 71 | Improved |
| Use the harmonic Σ-OWA objective instead of the utilitarian objective | Conference paper assignment · MD-00002-00000003 | average top-ranked papers per agent: 4.2 -> 4 | Mixed |
| Use the harmonic Σ-OWA objective instead of the egalitarian objective | Conference paper assignment · MD-00002-00000003 | average top-ranked papers per agent: 3 -> 4 | Improved |
Closest papers by meaning
- Fair and Welfare-Efficient Constrained Multi-Matchings under Uncertainty (NeurIPS 2024 · similarity 0.86)
- The Complexity of Extending Fair Allocations of Indivisible Goods (AAAI 2025 · similarity 0.85)
- Almost Envy-Free Allocations of Indivisible Goods or Chores with Entitlements (AAAI 2024 · similarity 0.84)
- MATWA: A Web Toolkit for Matching Under Preferences (AAAI 2025 · similarity 0.84)
- Online Fair Division Meets Reordering Buffers (NeurIPS 2026 · similarity 0.84)
- Understanding EFX Allocations: Counting and Variants (AAAI 2025 · similarity 0.84)
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.
