Efficient, traceable, and numerical error-free implementation of the MMS voting rule
Luis S\'anchez-Fern\'andez
TL;DR
This paper introduces a new algorithm for computing the MMS voting rule that replaces linear programming with a sequence of maximum flow problems, enhancing efficiency and traceability.
Contribution
The paper presents an innovative algorithm for MMS voting rule computation using maximum flow problems, improving over traditional linear programming methods.
Findings
The new algorithm is more efficient than previous methods.
It provides better traceability of the computation process.
It maintains numerical accuracy without errors.
Abstract
I propose an alternative algorithm to compute the MMS voting rule. Instead of using linear programming, in this new algorithm the maximin support value of a committee is computed using a sequence of maximum flow problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAuction Theory and Applications · Game Theory and Voting Systems · Transportation Planning and Optimization