Complexity of Elections: Young and Dodgson Voting Systems: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 03:4803:48, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,692 bytes +1,692‎ Created page with "Title: Complexity of Elections: Young and Dodgson Voting Systems Abstract: This research study investigates the complexity of determining the winner and ranking in Young and Dodgson voting systems. It presents results that show that both problems are complete for PNP/bardbl, a class of problems solvable in polynomial time by parallel access to an NP oracle. The study also explores a homogeneous variant of Dodgson elections proposed by Fishburn and demonstrates that the..."
Retrieved from "https://simplesci.org/wiki/Complexity_of_Elections:_Young_and_Dodgson_Voting_Systems"