Research map / Learning theory and algorithms / Submodular and game algorithms
Truthful and Fair Mechanisms for Matroid-Rank Valuations
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 |
|---|---|---|---|
| Use the Prioritized Egalitarian (PE) mechanism with lexicographic tie-breaking | Matroid-rank valuations · Indivisible-goods allocation | strategy-proofness guarantee | Helped |
| Require truthfulness, index-obliviousness, and Pareto efficiency together with MMS | Matroid-rank valuations · Indivisible-goods allocation | existence of a truthful MMS mechanism | Hurt |
| Replace Pareto efficiency with the weaker local-efficiency requirement while retaining truthfulness, index-obliviousness, and MMS | Matroid-rank valuations · Indivisible-goods allocation | existence of a truthful MMS mechanism | Hurt |
| Characterize truthful, non-wasteful mechanisms using gradualness | Matroid-rank valuations · Mechanism design | truthfulness characterization | Helped |
Closest papers by meaning
- Plant-and-Steal: Truthful Fair Allocations via Predictions (NeurIPS 2024 · similarity 0.91)
- The Complexity of Fair Division of Indivisible Items with Externalities (AAAI 2024 · similarity 0.91)
- Weighted Envy-Freeness for Submodular Valuations (AAAI 2024 · similarity 0.91)
- 1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations (AAAI 2024 · similarity 0.90)
- Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously (AAAI 2025 · similarity 0.90)
- Constrained Fair and Efficient Allocations (AAAI 2025 · similarity 0.90)
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.