EADA's expected average rank is at most 4 log log n + O(1), and every Pareto-efficient mechanism that weakly Pareto-dominates Deferred Acceptance achieves O((log log n)^2).
4 Marek Pycia
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Efficiency Adjustments Break the Logarithmic Rank Barrier
EADA's expected average rank is at most 4 log log n + O(1), and every Pareto-efficient mechanism that weakly Pareto-dominates Deferred Acceptance achieves O((log log n)^2).