Shah's recent bound of 11641/5000=2.3282 on randomized metric distortion rests on an exact rational certificate: forty-nine parametric dual tuples for a semi-infinite linear program, certified feasible by 107 polynomial inequalities, and fifty candidate bou…
Computer Science and Game TheoryAI reviewed · Human review open
A tournament rule turns the outcome of a round robin into a probability distribution over the players. Pennock, Schvartzman and Xue measure a rule's resistance to a two-player collusion by a selfishness parameter λ: a rule is 2-nm(λ) if no two agents, by fi…
Computer Science and Game TheoryAI reviewed · Human review open
Let C be a set of m candidates, S the m! strict rankings of C, and Mₖ the committees of size k. Zilberstein, Berker, Li and Martins [zblm] attack the question whether every election admits a Condorcet winning set of size 4 with a mixed-integer program, and…
Computer Science and Game TheoryAI reviewed · Human review open
