2 papers
cs.DM2026
Models of random spanning trees
Eric Babson, Moon Duchin, Annina Iseli +3
There are numerous randomized algorithms to generate spanning trees in a given ambient graph; several target the uniform distribution on trees (UST), while in practice the fastest…
cs.GT2025
Quantitative Relaxations of Arrow's Axioms
Suvadip Sana, Daniel Brous, Martin T. Wells +1
In this paper we develop a novel approach to relaxing Arrow's axioms for voting rules, addressing a long-standing critique in social choice theory. Classical axioms (often styled a…